Advertisement

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

  • Prosenjit Bose
  • Karim Douïeb
  • Vida Dujmović
  • Rolf Fagerberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)

Abstract

We present the zipper tree, an O(log log n)-competitive online binary search tree that performs each access in O(logn) worst-case time. This shows that for binary search trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously.

Keywords

Competitive Ratio Binary Search Tree Prefer Path Hybrid Tree Concatenation Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bose, P., Douïeb, K., Dujmović, V., Fagerberg, R.: An O(loglog n)-competitive binary search tree with optimal worst-case access times, arXiv 1003.0139 (2010)Google Scholar
  2. 2.
    Demaine, E., Harmon, D., Iacono, J., Kane, D.M., Patrascu, M.: The geometry of binary search trees. In: Proc. of the 10th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 496–505 (2009)Google Scholar
  3. 3.
    Demaine, E., Harmon, D., Iacono, J., Pătraşcu, M.: Dynamic optimality—almost. SICOMP 37(1), 240–251 (2007)zbMATHGoogle Scholar
  4. 4.
    Derryberry, J., Sleator, D.D., Wang, C.C.: O(loglogn)-competitive dynamic binary search trees. In: Proc. of the 7th ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 374–383 (2006)Google Scholar
  5. 5.
    Georgakopoulos, G.F.: Chain-splay trees, or, how to achieve and prove loglogn-competitiveness by splaying. Inf. Process. Lett. 106(1), 37–43 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proc. of the 19th Found. of Comp. Sci. (FOCS), pp. 8–21 (1978)Google Scholar
  7. 7.
    Iacono, J.: Personal communication (July 2009)Google Scholar
  8. 8.
    Kujala, J., Elomaa, T.: Poketree: A dynamically competitive data structure with good worst-case performance. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 277–288. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Munro, J.I.: On the competitiveness of linear search. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 338–345. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Wang, C.C.: Multi-Splay Trees. PhD thesis, Computer Science Department, School of Computer Science, Carnegie Mellon University (2006)Google Scholar
  12. 12.
    Wilber, R.: Lower bounds for accessing binary search trees with rotations. SICOMP 18(1), 56–67 (1989)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Woo, S.L.: Heterogeneous Decomposition of Degree-Balanced Search Trees and Its Applications. PhD thesis, Computer Science Department, School of Computer Science, Carnegie Mellon University (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Prosenjit Bose
    • 1
  • Karim Douïeb
    • 1
  • Vida Dujmović
    • 1
  • Rolf Fagerberg
    • 2
  1. 1.School of Computer ScienceCarleton University 
  2. 2.Department of Mathematics and Computer ScienceUniversity of Southern Denmark 

Personalised recommendations