A new randomized data structure for the 11/2-dimensional range query problem

Authors:
Panayiotis Bozanis
Affiliations:
Department of Computer and Communication Engineering, University of Thessaly, Volos, Greece
Venue:
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Year:
2001

Citing 5
Cited 0

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Skip lists and probabilistic analysis of algorithms

Skip lists and probabilistic analysis of algorithms
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

IEEE Transactions on Computers
Computational Geometry: Algorithms and Applications

Computational Geometry: Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose RPST, a randomized data structure for the 11/2-dimensional range query problem, based on a version of Skip Lists, as an alternative to solutions that use deterministic height balanced trees. Our scheme exhibits, with high probability, logarithmic, output-sensitive search time, expected logarithmic update time, expected constant reconstruction time and linear space overhead with high probability.