Abstract
A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed—where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree. A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.
Research for P. Bose supported in part by NSERC.
Research partially completed at NYU School of Engineering with support from NSF grant CCF-1319648. Research partially completed at Université Libre de Bruxelles with support from FNRS. Research partially completed at and supported by MADALGO, a center of the Danish National Research Foundation.
S. Langerman is Directeur de Recherches du F.R.S.-FNRS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adelson-Velskij, G.M., Landis, E.M.: An Algorithm for the Organization of Information. Doklady Akademii Nauk USSR 146(2), 263–266 (1962)
Alon, N., Spencer, J.: The Probabilistic Method. John Wiley (1992)
Aragon, C.R., Seidel, R.: Randomized search trees. In: FOCS, pp. 540–545. IEEE Computer Society (1989)
Bender, M.A., Duan, Z., Iacono, J., Jing, W.: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2), 115–136 (2004)
Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: Govindarajan, R., Padua, D.A., Hall, M.W. (eds.) PPOPP, pp. 257–268. ACM (2010)
Clark, D.R., Ian Munro, J.: Efficient suffix trees on secondary storage (extended abstract). In: Tardos, É. (ed.) SODA, pp. 383–391. ACM/SIAM (1996)
Cole, R.: On the dynamic finger conjecture for splay trees. part ii: The proof. SIAM J. Comput. 30(1), 44–85 (2000)
Cole, R., Mishra, B., Schmidt, J.P., Siegel, A.: On the dynamic finger conjecture for splay trees. part i: Splay sorting log n-block sequences. SIAM J. Comput. 30(1), 1–43 (2000)
Demaine, E.D., Iacono, J., Langerman, S.: Worst-case optimal tree layout in a memory hierarchy. CoRR, cs.DS/0410048 (2004)
Demaine, E.D., Iacono, J., Langerman, S., Özkan, Ö.: Combining binary search trees. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 388–399. Springer, Heidelberg (2013)
Fredman, M.L.: Two applications of a probabilistic search technique: Sorting x + y and building balanced search trees. In: Rounds, W.C., Martin, N., Carlyle, J.W., Harrison, M.A. (eds.) STOC, pp. 240–244. ACM (1975)
Gil, J., Itai, A.: How to pack trees. J. Algorithms 32(2), 108–132 (1999)
Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: FOCS, pp. 8–21. IEEE Computer Society (1978)
Iacono, J., Mulzer, W.: A static optimality transformation with applications to planar point location. Int. J. Comput. Geometry Appl. 22(4), 327–340 (2012)
Knuth, D.E.: Optimum binary search trees. Acta Inf. 1, 14–25 (1971)
Mehlhorn, K.: Nearly optimal binary search trees. Acta Inf. 5, 287–295 (1975)
Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica 16(4/5), 464–497 (1996)
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)
van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6(3), 80–82 (1977)
Wilber, R.E.: Lower bounds for accessing binary search trees with rotations. SIAM J. Comput. 18(1), 56–67 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bose, P., Douïeb, K., Iacono, J., Langerman, S. (2014). The Power and Limitations of Static Binary Search Trees with Lazy Finger. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-13075-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13074-3
Online ISBN: 978-3-319-13075-0
eBook Packages: Computer ScienceComputer Science (R0)