Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying

We present an extension of the splay technique, the chain-splay. Chain-splay trees 'splay' the accessed element to the root as classical 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 algorithm that maintains a binary search tree with rotations. This result is the nearest point to the dynamic optimality that splay trees have reached since 1983.

[1]  Richard Cole,et al.  On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences , 1995, SIAM J. Comput..

[2]  J. Ian Munro,et al.  Self-organizing binary search trees , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3]  Erik D. Demaine,et al.  Dynamic Optimality - Almost , 2004, FOCS.

[4]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[5]  George F. Georgakopoulos.  How to Splay for loglog N-Competitiveness , 2005, WEA.

[6]  George F. Georgakopoulos,et al.  Generalized Template Splay: A Basic Theory and Calculus , 2004, Comput. J..

[7]  Rudolf Bayer,et al.  Organization and maintenance of large ordered indexes , 1972, Acta Informatica.

[8]  Charles U. Martel.  Self-Adjusting Multi-Way Search Trees , 1991, Inf. Process. Lett..

[9]  Susanne Albers,et al.  Self-Organizing Data Structures , 1996, Online Algorithms.

[10]  Robert E. Wilber.  Lower Bounds for Accessing Binary Search Trees with Rotations , 1989, SIAM J. Comput..

[11]  Ashok Subramanian.  An Explanation of Splaying , 1996, J. Algorithms.

[12]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[13]  Murray Sherk.  Self-Adjusting k-ary Search Trees , 1995, J. Algorithms.

[14]  Venkatesh Raman,et al.  Path Balance Heuristic for Self-Adjusting Binary Search Trees , 1995, FSTTCS.

[15]  George F. Georgakopoulos,et al.  Sphendamnoe: A Proof that k-Splay Fails to Achieve logkN Behaviour , 2001, Panhellenic Conference on Informatics.

[16]  Richard Cole,et al.  On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof , 2000, SIAM J. Comput..

[17]  Donald E. Knuth,et al.  Optimum binary search trees , 1971, Acta Informatica.

[18]  George F. Georgakopoulos.  Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees , 2004, J. Algorithms.

[19]  Adam Tauman Kalai,et al.  Static Optimality and Dynamic Search-Optimality in Lists and Trees , 2002, SODA '02.

[20]  John Iacono,et al.  Key Independent Optimality , 2002, ISAAC.

[21]  Martin Fürer.  Randomized splay trees , 1999, SODA '99.

[22]  Daniel Dominic Sleator,et al.  O(log log n)-competitive dynamic binary search trees , 2006, SODA '06.

[23]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[24]  R. Tarjan.  Amortized Computational Complexity , 1985 .