This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Constructing Optimal Search Trees in Optimal Time
July 1999 (vol. 48 no. 7)
pp. 738-743

Abstract$(a,b)$-trees are an important class of search trees. They include 2-3 trees, 2-3-4 trees, and $B$-trees as subclasses. We show that a space-minimum $(a,b)$-tree is also height-minimum and present an optimal algorithm for constructing $(a,b)$-trees that are height-minimum and space-minimum. Given $n$ keys, our algorithm constructs an $(a,b)$-tree with minimum height and fewest possible nodes. Our algorithm takes $\Theta(n)$ time if the keys in $S$ are sorted and $\Theta(n \log n )$ time if the keys are not sorted. We also discuss possible applications of our algorithm.

[1] P. Becker, “A New Algorithm for the Construction of Optimal B-Trees,” Lecture Notes in Computer Science, vol. 824, pp. 49-60, 1994.
[2] R. Bayer and E.M. McCreight, “Organization and Maintenance of Large Ordered Indices,” Acta Informatica, vol. 1, no. 3, 1972.
[3] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[4] C.J. Date, An Introduction to Database Systems, Volume 1.Reading, Mass.: Addison-Wesley, 1990.
[5] S.K. Das and K.B. Min, “A Unified Approach to the Parallel Construction of Search Trees,” J. Parallel and Distributed Computing, vol. 27, pp. 71-78, 1995.
[6] N. Deo, A. Jain, and M. Medidi, “Constructing Height-Balanced Trees in Parallel,” Proc. 1992 Int'l Conf. Parallel Processing, vol. 3, pp. 297-300, 1992.
[7] E. Horowitz and S. Sahni, Fundamentals of Data Structures. Woodland Hills, 1983.
[8] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[9] H.F. Korth and A. Silberschatz, Database System Concepts. McGraw-Hill Advanced Computer Science Series. McGraw-Hill Book Co., 1986.
[10] L. Gotlieb, “Optimal Multiway Search Trees,” SIAM J. Computing, vol. 10, no. 3, pp. 422-433, 1981.
[11] V.K. Vaishnavi, H.P. Kriegel, and D. Wood, “Optimum Multiway Search Trees,” Acta Informatica, vol. 14, pp. 119-133, 1980.
[12] B.-F. Wang and G.-H Chen, “Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees,” J. Parallel and Distributed Computing, vol. 11, no. 3, pp. 257-261, 1991.
[13] B.-F. Wang, G.-H Chen, and M.S. Yu, “Cost-Optimal Parallel Algorithms for Constructing B-Trees,” Proc. 1991 Int'l Conf. Parallel Processing, vol. 3, pp. 294-295, 1991.
[14] Y. Lin and S.Q. Zheng, “Constructing Optimal B-Trees in Optimal Time,” Congressus Numerantium, vol. 76, pp. 243-254, 1990.

Index Terms:
2-3 trees, 2-3-4 trees, algorithms, $(a,b)$-trees, $B$-trees, databases, data structures, indexing, search trees, tree construction.
Citation:
S.q. Zheng, M. Sun, "Constructing Optimal Search Trees in Optimal Time," IEEE Transactions on Computers, vol. 48, no. 7, pp. 738-743, July 1999, doi:10.1109/12.780881
Usage of this product signifies your acceptance of the Terms of Use.