In Pursuit of the Dynamic Optimality Conjecture
In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we survey the progress that has been made in the almost thirty years since the conjecture was first formulated, and present a binary search tree algorithm that is dynamically optimal if any binary search tree algorithm is dynamically optimal.
KeywordsOnline Algorithm Search Sequence Search Path Binary Search Tree Prefer Path
Unable to display preview. Download preview PDF.
- 6.Bose, P., Douïeb, K., Iacono, J., Langerman, S.: The power and limitations of static binary search trees with lazy finger. CoRR, abs/1304.6897 (2013)Google Scholar
- 9.Derryberry, J.: Adaptive Binary Search Trees. PhD thesis, CMU (2009)Google Scholar
- 10.Demaine, E.D., Harmon, D., Iacono, J., Kane, D.M., Patrascu, M.: The geometry of binary search trees. In: Mathieu, C. (ed.) SODA, pp. 496–505. SIAM (2009)Google Scholar
- 12.Demaine, E.D., Iacono, J., Langerman, S., Özkan, Ö.: Combining binary search trees. CoRR, abs/1304.7604 (2013)Google Scholar
- 15.Harmon, D.: New Bounds on Optimal Binary Search Trees. PhD thesis, MIT (2006)Google Scholar
- 16.Lucas, J.M.: Canonical forms for competitive binary search tree algorithms. Technical Report DCS-TR-250, Rutgers University (1988)Google Scholar
- 17.Sleator, D.: Achieving the unified bound in the bst model. In: 5th Bertinoro Workshop on Algorithms and Data Structures. Talk (2011)Google Scholar