Skip to main content
SpringerLink
Log in

How to Splay for loglogN-Competitiveness

  • Conference paper
Experimental and Efficient Algorithms (WEA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3503))

Included in the following conference series:

Abstract

We present an extension of the splay technique, the chain-splay. Chain-splay trees splay the accessed element to the root exactly as classic splay trees do, but also perform some local ‘house-keeping’ splay operations below the accessed element. We prove that chain-splay is loglogN-competitive to any off-line searching algorithm. This result is the nearest point to dynamic optimality of splay trees reached since 1983.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adel’son-Vel’ski, G.M., Landis, E.M.: An Algorithm for the Organization of Information. Soviet Mathematical Doklady 146, 1259–1263 (1962)

    Google Scholar 

  2. Albers, S., Westbrook, J.: Self-Organizing Data-Structures. In: Fiat, A. (ed.) Dagstuhl Seminar 1996, vol. 1442. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Allen, B., Munro, I.J.: Self Organizing Binary Search Trees. J. of the ACM 25(4), 526–535 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  4. Balasubramanian, R., Raman, V.: Path Balance Heuristic For Self-Adjusting Binary Search Trees. In: Thiagarajan, P.S. (ed.) FSTTCS 1995, vol. 1026, pp. 338–348. Springer, Heidelberg (1995)

    Google Scholar 

  5. Bayer, R., McCreight, E.: Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1(3), 173–189 (1972)

    Article  Google Scholar 

  6. Blum, A., Chawla, S., Kalai, A.: Static Optimality and Dynamic Search-Optimality in Lists and Trees. In: ACM-SIAM Symp. on Discrete Algorithms, 13th, San Francisco, USA, January 6–8, pp. 1–8 (2002)

    Google Scholar 

  7. Cole, R.J.: On the Dynamic Finger Conjecture for Splay Trees, Part II: The Proof. SIAM J. on Computing 30(1), 44–85 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cole, R.J., Mishra, B., Schmidt, J.P., Siegel, A.: On the Dynamic Finger Conjecture for Splay Trees, Part I: Splaying Sorting in log n-Block Sequences. SIAM J. on Computing 30(1), 1–43 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Demaine, D.E., Harmon, D., Iacono, J., Pătraşcu, M.: Dynamic Optimality—Almost. In: IEEE Symp. on the Foundations of Computer Science, 45th, Rome, Italy, October 17–19, pp. 484–490 (2004)

    Google Scholar 

  10. Fürer, M.: Randomized Splay Trees. In: ACM-SIAM Symp. on Discrete Algorithms, 10th, Maryland, USA, January 17–19, pp. 903–904 (1999)

    Google Scholar 

  11. Georgakopoulos, G.F.: Splay Trees: a Reweighing Lemma and a Proof of Competitiveness vs. Dynamic Balanced Trees. J. of Algorithms 51, 64–76 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Georgakopoulos, G.F., McClurkin, D.J.: Sphendamnoe: A Proof that k-Splay Falls to Achieve logk N Behaviour. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds.) PCI 2001, vol. 2563, pp. 480–496. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Georgakopoulos, G.F., McClurkin, D.J.: General Template Splay: A Basic Theory and Calculus. The Computer Journal 41(1), 10–19 (2004)

    Article  Google Scholar 

  14. Iacono, J.: Key Iindependent Optimality. In: Bose, P., Morin, P. (eds.) ISAAC 2002, vol. 2518, pp. 25–31. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Knuth, D.E.: Optimum Binary Search Trees. Acta Informatica 1, 14–25 (1971)

    Article  MATH  Google Scholar 

  16. Martel, C.: Self-Adjusting Multi-Way Search Trees. Information Processing Letters 38(3), 135–141 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Overmars, M.H.: The Design of Dynamic Data Structures, vol. 156. Springer, Heidelberg (1983)

    MATH  Google Scholar 

  18. Sherk, M.: Self Adjusting k-ary Search Trees. J. of Algorithms 19, 25–44 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sleator, D.D., Tarjan, R.E.: Self Adjusting Binary Search Trees. J. of the ACM 32(3), 652–686 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  20. Subramanian, A.: An Explanation of Splaying. J. of Algorithms 20, 512–525 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  21. Sundar, R.: Twists, Turns, Cascades, Dequeue Conjecture and Scanning Theorem. In: IEEE Symp. on the Foundations of Computer Science, 30th, North Carolina, USA, October 30 – November 1, pp. 555–559 (1989)

    Google Scholar 

  22. Tarjan, R.E.: Amortized Computational Complexity. J. of Applied and Discrete Mathematics 6(2), 306–318 (1985)

    MATH  MathSciNet  Google Scholar 

  23. Wilber, R.: Lower Bounds for Accessing Binary Search Trees with Rotations. SIAM J. on Computing 18(1), 56–67 (1989)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Crete, Knossou Av., GR-71409, Heraklion, Crete, Greece

    George F. Georgakopoulos

Authors
  1. George F. Georgakopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CTI and Univ. of Patras, Greece

    Sotiris E. Nikoletseas

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georgakopoulos, G.F. (2005). How to Splay for loglogN-Competitiveness. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_49

Download citation

  • DOI: https://doi.org/10.1007/11427186_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25920-6

  • Online ISBN: 978-3-540-32078-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation