Abstract
Equations are derived for the variance of the number of leaf nodes in a B-tree or B+-tree with records inserted in random order. These show that the variance is asymptotically proportional to the number of records. Calculated values of the ratio are included.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baeza-Yates, R. A.: Expected behavior of B+-trees under random insertions. Acta Inf.26, 439–371 (1989)
Bagchi, A., Pal, A. K.: Asymptotic normality in the generalized Polya-Eggenberger urn model, with an application to computer data structures. SIAM J. Alg. Disc. Meth.6, 394–404 (1985)
Comer, D.: The ubiquitous B-tree. Comput. Surv.11, 121–137 (1979)
Eisenbarth, B., Ziviani, N., Gonnet, G. H., Mehlhorn, K., Wood, D.: The theory of fringe analysis and its application to 2–3 trees and B-trees. Inf. Control55, 125–174 (1982)
Knuth, D. E.: The art of computer programming, Vol. 3: Sorting and searching, 1st edn. Reading, Mass.: Addison Wesley 1973
Park, S. K., Miller, K. W.: Random number generators: good ones are hard to find. ACM Commun.31, 1192–1201 (1988)
Yao, A.: On random 2–3 trees. Acta. Inf.9, 159–170 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Peterson, W.W. Variance of storage requirements for B+-trees. Acta Informatica 32, 611–625 (1995). https://doi.org/10.1007/BF01186643
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01186643