It is shown that ¯n (N), the average number of nodes in an N-key random 2–3 tree, satisfies the inequality 0.70 N < ¯n(N) <0.79 N for large N. A similar analysis is done for general B-trees. It is shown that storage utilization is essentially ln 2≈69% for B-tree of high orders.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading (Mass.): Addison-Wesley 1974Google Scholar
- 2.Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Informat. 1, 173–189 (1972)Google Scholar
- 3.Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected combinatorial research problems. Computer Science Dept., Stanford University, Problem 37, STAN-CS-72-292, 1972Google Scholar
- 4.Knuth, D.E.: The art of computer programming, Vol. 1, Fundamental algorithms. Reading (Mass.): Addison-Wesley 1968Google Scholar
- 5.Knuth, D.E.: The art of computer programming, Vol. 3, Sorting and searching. Reading (Mass.): Addison-Wesley 1973Google Scholar
- 6.Yao, A. C.: On random 3-2 trees. Department of Computer Science, University of Illinois, Technical Report (74-679), October 1974Google Scholar