Skip to main content
Article thumbnail
Location of Repository

Randomized splay trees: theoretical and experimental results

By Susanne Albers and Marek Karpinski

Abstract

Abstract Splay trees are self-organizing binary search trees that were introduced by Sleator andTarjan [12]. In this paper we present a randomized variant of these trees. The new algorithm for reorganizing the tree is both simple and easy to implement. We prove that our randomizedsplaying scheme has the same asymptotic performance as the original deterministic scheme but improves constants in the expected running time. This is interesting in practice becausethe search time in splay trees is typically higher than the search time in skip lists and AVLtrees. We present a detailed experimental study of our algorithm. On request sequencesgenerated by fixed probability distributions, we can achieve improvements of up to 25 % over deterministic splaying. On request sequences that exhibit high locality of reference, theimprovements are minor

Topics: Data structures, Randomized algorithms, Splay trees
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.9008
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.informatik.uni-frei... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.