B-trees - A simple proof of their space utilisation

J. Hext

B-trees - A simple proof of their space utilisation

J. Hext^*

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

Abstract

It is well known that under random insertions the space utilisation of B-trees is approximately ln 2. This paper provides a simple proof. Copyright

Original language	English
Pages (from-to)	356-359
Number of pages	4
Journal	Journal of Research and Practice in Information Technology
Volume	33
Issue number	4
Publication status	Published - 2001

Cite this

@article{cd20f4851cc04a29b72cf04694afa8c2,

title = "B-trees - A simple proof of their space utilisation",

abstract = "It is well known that under random insertions the space utilisation of B-trees is approximately ln 2. This paper provides a simple proof. Copyright",

author = "J. Hext",

year = "2001",

language = "English",

volume = "33",

pages = "356--359",

journal = "Journal of Research and Practice in Information Technology",

issn = "1443-458X",

publisher = "Australian Computer Society",

number = "4",

}

TY - JOUR

T1 - B-trees - A simple proof of their space utilisation

AU - Hext, J.

PY - 2001

Y1 - 2001

N2 - It is well known that under random insertions the space utilisation of B-trees is approximately ln 2. This paper provides a simple proof. Copyright

AB - It is well known that under random insertions the space utilisation of B-trees is approximately ln 2. This paper provides a simple proof. Copyright

UR - http://www.scopus.com/inward/record.url?scp=33747504686&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:28844459678

SN - 1443-458X

VL - 33

SP - 356

EP - 359

JO - Journal of Research and Practice in Information Technology

JF - Journal of Research and Practice in Information Technology

IS - 4

ER -

B-trees - A simple proof of their space utilisation

Abstract

Other files and links

Fingerprint

Cite this