Abstract
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Derryberry et al. As part of their results, Demaine et al. considered GreedyFuture, an offline BST algorithm that greedily rearranges the search path to minimize the cost of future searches. They showed that GreedyFuture is actually an online algorithm in their geometric view, and that there is a way to turn GreedyFuture into an online BST algorithm with only a constant factor increase in total search cost. Demaine et al. conjectured this algorithm was dynamically optimal, but no upper bounds were given in their paper. We prove the first non-trivial upper bounds for the cost of search operations using GreedyFuture including giving an access lemma similar to that found in Sleator and Tarjan’s classic paper on splay trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bose, P., Douïeb, K., Dujmović, V., Fagerberg, R.: An O(loglogn)-competitive binary search tree with optimal worst-case access times. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 38–49. Springer, Heidelberg (2010)
Cole, R.: On the dynamic finger conjecture for splay trees. Part II: The proof. SIAM J. Comput. 30, 44–85 (2000)
Cole, R., Mishra, B., Schmidt, J., Siegel, A.: On the dynamic finger conjecture for splay trees. Part I: Splay sorting logn-block sequences. SIAM J. Comput. 30, 1–43 (2000)
Demaine, E.D., Harmon, D., Iacono, J., Kane, D., Pătraşcu, M.: The geometry of binary search trees. In: Proc. 20th ACM/SIAM Symposium on Discrete Algorithms, pp. 496–505 (2009)
Demaine, E.D., Harmon, D., Iacono, J., Pătraşcu, M.: Dynamic optimality–almost. SIAM J. Comput. 37(1), 240–251 (2007)
Derryberry, J., Sleator, D.D., Wang, C.C.: A lower bound framework for binary search trees with rotations. Tech. Rep. CMU-CS-05-187. Carnegie Mellon University (2005)
Elmasry, A.: On the sequential access theorem and deque conjecture for splay trees. Theoretical Computer Science 314(3), 459–466 (2004)
Goyal, N., Gupta, M.: On dynamic optimality for binary search trees (2011), http://arxiv.org/abs/1102.4523
Iacono, J.: Key independent optimality. Algorithmica 42, 3–10 (2005)
Lucas, J.M.: Canonical forms for competitive binary search tree algorithms. Tech. Rep. DCS-TR-250. Rutgers University (1988)
Munro, J.I.: On the competitiveness of linear search. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 338–345. Springer, Heidelberg (2000)
Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the Association for Computing Machinery 32(3), 652–686 (1985)
Tarjan, R.E.: Sequential access in splay trees takes linear time. Combinatorica 5, 367–378 (1985)
Wang, C.C.: Multi-Splay Trees. Ph.D. thesis. Carnegie Mellon University (2006)
Wang, C.C., Derryberry, J., Sleator, D.D.: O(loglogn)-competitive binary search trees. In: Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 374–383 (2006)
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fox, K. (2011). Upper Bounds for Maximally Greedy Binary Search Trees. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-22300-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22299-3
Online ISBN: 978-3-642-22300-6
eBook Packages: Computer ScienceComputer Science (R0)