Layered working-set trees

Authors:
Prosenjit Bose;Karim Douïeb;Vida Dujmović;John Howat
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Year:
2010

Citing 9
Cited 3

Data structures and network algorithms

Data structures and network algorithms
Self-adjusting binary search trees

Journal of the ACM (JACM)
Lower bounds for accessing binary search trees with rotations

SIAM Journal on Computing
Introduction to Algorithms

Introduction to Algorithms
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences

SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof

SIAM Journal on Computing
A unified access bound on comparison-based dynamic dictionaries

Theoretical Computer Science
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Skip-Splay: Toward Achieving the Unified Bound in the BST Model

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

A static optimality transformation with applications to planar point location

Proceedings of the twenty-seventh annual symposium on Computational geometry
A distribution-sensitive dictionary with low space overhead

Journal of Discrete Algorithms
De-amortizing binary search trees

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense, while data structures that are not binary search trees are known to have this property in the worst case. We close this gap and present a binary search tree called a layered working-set tree that guarantees the working-set property in the worst case. The unified bound [Bădoiu et al., TCS, 2007] roughly states that searching for an element is fast if it is near (in terms of rank distance) to a recently accessed element. We show how layered working-set trees can be used to achieve the unified bound to within a small additive term in the amortized sense while maintaining in the worst case an access time that is both logarithmic and within a small multiplicative factor of the working-set bound.