Biased Skip Lists

Authors:
Amitabha Bagchi;Adam L. Buchsbaum;Michael T. Goodrich
Affiliations:
-;-;-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 12
Cited 0

Self-adjusting binary search trees

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
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
An evaluation of self-adjusting binary search tree techniques

Software—Practice & Experience
Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations

Journal of Algorithms
Biased dictionaries with fast insert/deletes

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project

Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Biased Skip Lists for Highly Skewed Access Patterns

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Proactive Caching of DNS Records: Addressing a Performance Bottleneck

SAINT '01 Proceedings of the 2001 Symposium on Applications and the Internet (SAINT 2001)
System design issues for internet middleware services: deductions from a large client trace

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 驴 i 驴 n, the time to access item i is O(1 + log W/wi), where W = 驴i = 1n wi; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both.