
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
R.P. Cheetham, B.J. Oommen, D.T.H. Ng, "Adaptive Structuring of Binary Search Trees Using Conditional Rotations," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 4, pp. 695704, August, 1993.  
BibTex  x  
@article{ 10.1109/69.234780, author = {R.P. Cheetham and B.J. Oommen and D.T.H. Ng}, title = {Adaptive Structuring of Binary Search Trees Using Conditional Rotations}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {5}, number = {4}, issn = {10414347}, year = {1993}, pages = {695704}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.234780}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Adaptive Structuring of Binary Search Trees Using Conditional Rotations IS  4 SN  10414347 SP695 EP704 EPD  695704 A1  R.P. Cheetham, A1  B.J. Oommen, A1  D.T.H. Ng, PY  1993 KW  adaptive structuring; binary search trees; conditional rotations; restructuring heuristic; integer memory locations; weighted path length; simulation; tree data structures VL  5 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Consider a set A=(A_1,A_2,..., A_n) of records, where each record is identified by a unique key. The records are accessed based on a set of access probabilities S=(s_1,s_2,..., s_n) and are to be arranged lexicographically using a binary search tree (BST). If S is known a priori, it is well known that an optimal BST may be constructed using A and S. The case when S is not known a priori is considered. A new restructuring heuristic is introduced that requires three extra integer memory locations per record. In this scheme, the restructuring is performed only if it decreases the weighted path length (WPL) of the overall resultant tree. An optimized version of the latter method, which requires only one extra integer field per record has, is presented. Initial simulation results comparing this algorithm with various other static and dynamic schemes indicates that this scheme asymptotically produces trees which are an order of magnitude closer to the optimal one than those produced by many of the other BST schemes reported in the literature.
[1] G. M. Adel'sonVelski'i and E. M. Landis, "An algorithm for the organization of information,"Sov. Math. Dokl., vol. 3 pp. 12591262, 1962.
[2] B. Allen and I. Munro, "Selforganizing binary search trees,"J. ACM, vol. 25, pp. 526535, 1978.
[3] D. M. Arnow and A. M. Tenenbaum, "An investigation of the moveaheadk rules," inCongressus Numerantium, Proc. Thirteenth Southeastern Conf. Combinatorics, Graph Theory and Computing, pp. 4765, Feb. 1982.
[4] P. J. Bayer, "Improved bounds on the costs of optimal and balanced binary search trees,"MAC Tech. Memo69, Nov. 1975.
[5] J. R. Bitner, "Heuristics that dynamically organize data structures,"SIAM J. Comput., vol. 8, pp. 82110, 1979.
[6] R. P. Cheetham, B. J. Oommen, and D. T. H. Ng,Adaptive Structuring of Binary Search Trees Using Conditional Rotations, Technical Report available as SCSTR126 from the School of Computer Science, Carleton University, Ottawa, Canada.
[7] G. H. Gonnet, "Balancing binary trees by internal path reduction,"Commun. ACM, vol. 26, pp. 10741081, 1983.
[8] G. H. Gonnet, J. I. Munro, and H. Suwanda, "Exegesis of selforganizing linear search,"SIAM J. Comput., vol. 10, pp. 613637, 1981.
[9] H. J. Hester and D. S. Hirschberg, "Selforganizing linear search,"ACM Computing Surveys, pp. 295311, 1976.
[10] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: AddisonWesley, 1973.
[11] T. W. Lai and D. Wood, "A relationship between self organizing lists and binary search trees," inProc. 1991 Int. Conf. Computing and Information, pp. 111116, May 1991.
[12] J. McCabe "On serial files with relocatable records".Operations Research, vol. 12, pp. 609618, 1965.
[13] K. Mehlhorn, "Nearly optimal binary search trees,"Acta Informatica, vol. 5, pp. 287295, 1975.
[14] K. Mehlhorn, "Dynamic binary search,"SIAM J. Comput., vol. 8, pp. 175198, 1979
[15] K. Mehlhorn,Data Structures and Algorithms 1 : Sorting and Searching. Berlin: Springer Verlag, 1984.
[16] B. J. Oommen and E. R. Hansen, "List organizing strategies using stochastic movetofront and stochastic movetorear operations,"Siam J. Comput., vol. 16, pp. 705716, 1987.
[17] B. J. Oommen, E. R. Hansen, and J. I. Munro, "Deterministic optimal and expedient movetorear list organizing strategies,"Theoretical Computer Science, vol. 74, pp. 183197, 1990.
[18] R. L. Rivest, "On self organizing sequential search heuristics,"Comm. Ass. Comput. Mach., vol. 19, pp. 6367, 1976.
[19] D. D. Sleator and R. E. Tarjan, "Selfadjusting binary search trees,J. ACM, vol. 32, pp. 652686, 1985.
[20] W. A. Walker and C. C. Gotlieb, "A topdown algorithm for constructing nearly optimal lexicographical trees," inGraph Theory and Computing. New York: Academic Press, 1972.