Summary
We present a practical and efficient model for the estimation of average performance measures of B-trees under dynamic conditions of insertions and deletions. Performance measures computed are average storage utilization, average path length, and average tree height. The model introduces a data structure, called a lineage tree, which permits a highly compact representation of B-trees while still retaining information needed to compute the above performance measures. The model then involves a Markov chain in which the states are “lineages” obtained from the lineage tree. Probabilities, based on the number of B-tree structures corresponding to each lineage, are derived for the transition from one lineage to another under certain dynamic conditions. Results are given for tree orders ranging from 5 up to 401, and for numbers of keys up to 140000. Computer requirements are shown to be small to moderate.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Inf. 1, 173–189 (1972)
Brown, M.: Some observations on random 2–3 trees. Inf. Process. Lett. 9, 57–59 (1979)
Eisenbarth, B., Ziviani, N., Gonnet, G.H., Melhorn, K., Wood, D.: The theory of fringe analysis and its application to 2–3 trees and B-trees. Inf. Control 55, 125–174 (1982)
Huang, S.H.S.: Height-balanced trees of order (β, γ, δ). ACM Trans. Database Syst. 10, 261–284 (1985)
Gupta, G., Srinivasan, B.: Approximate storage utilization of B-trees. Inf. Process. Lett. 22, 243–246 (1986)
Knott, G.D.: A numbering system for binary trees. Commun. ACM 20, 113–115 (1977)
Knuth, D.E.: The Art of Computer Programming, vol. 3. Reading, Mass.: Addison-Wesley 1973
Kuspert, K.: Storage utilization in B-trees with a generalized overflow technique. Acta Inf. 19, 35–55 (1983)
Langenhop, C.E., Wright, W.E.: Certain occupancy numbers via an algorithm for computing their ratios. SIAM J. Disc. Math. 1, 360–371 (1988)
Liu, C.L.: Introduction to Combinatorial Mathematics. New York: McGraw-Hill 1968
Miller, R.E., Pippenger, N., Rosenberg, A.L., Snyder, L.: Optimal 2, 3 trees. SIAM J. Comput. 8, 42–59 (1979)
Mizoguchi, T.: On required space for random split files. Proc. 17th Annual Allerton Conf. on Communication, Control, and Computing, Monticello, IL, 1979, pp. 265–273
Proskurowski, A.: On the generation of binary trees. J. Assoc. Comput. Mach. 27, 1–2 (1980)
Quitzow, K., Klopproge, M.: Space utilization and access path length in B-trees. Inf. Syst. 5, 7–16 (1980)
Rosenberg, A.L., Snyder, L.: Minimal comparison 2, 3 trees. SIAM J. Comput. 7, 465–480 (1978)
Rosenberg, A.L., Snyder, L.: Time-and-space-optimality in B-trees. ACM Trans. Database Syst. 6, 174–183 (1981)
Rotem, D., Varol, Y.L.: Generation of binary trees from ballot sequences. J. Assoc. Comput. Mach. 25, 396–404 (1978)
Ruskey, F.: Listing and counting subtrees of a tree. SIAM J. Comput. 10, 141–150 (1981)
Ruskey, F., Hu, T.C.: Generating binary trees lexicographically. SIAM J. Comput. 6, 745–758 (1977)
Solomon, M., Finkel, R.A.: A note on enumerating binary trees. J. Assoc. Comput. Mach. 27, 3–5 (1980)
Wright, W.E.: Some average performance measures for the B-tree. Acta Inf. 21, 541–557 (1985)
Yao, A.C.: 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
Langenhop, C.E., Wright, W.E. A model of the dynamic behavior of B-trees. Acta Informatica 27, 41–59 (1989). https://doi.org/10.1007/BF00263500
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00263500