Poketree: a dynamically competitive data structure with good worst-case performance

Authors:
Jussi Kujala;Tapio Elomaa
Affiliations:
Institute of Software Systems, Tampere University of Technology, Tampere, Finland;Institute of Software Systems, Tampere University of Technology, Tampere, Finland
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 9
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Self-adjusting binary search trees

Journal of the ACM (JACM)
Sequential access in splay trees takes linear time

Combinatorica
Lower bounds for accessing binary search trees with rotations

SIAM Journal on Computing
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Deterministic skip lists

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms

Introduction to Algorithms
Dynamic Optimality " Almost

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
O(log log n)-competitive dynamic binary search trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

An O(log log n)-competitive binary search tree with optimal worst-case access times

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new O(lg lg n)-competitive binary search tree data structure called poketree that has the advantage of attaining, under worst-case analysis, O(lg n) cost per operation, including updates. Previous O(lg lg n)-competitive binary search tree data structures have not achieved O(lg n) worst-case cost per operation. A standard data structure such as red-black tree or deterministic skip list can be augmented with the dynamic links of a poketree to make it O(lg lg n)-competitive. Our approach also uses less memory per node than previous competitive data structures supporting updates.