In Proc. 33rd Annual ACM Symposium on Theory of Computing, pages 476-482, 2001.
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S ⊆ U, where U = {0,1,...,2^{w}-1}, which support various queries for integer intervals of U. For the query of reporting all integers in S contained within a query interval, we present an optimal data structure with linear space cost and with query time linear in the number of integers reported. This result holds in the unit cost RAM model with word size w and a standard instruction set. We also present a linear space data structure for approximate range counting. A range counting query for an interval returns the number of integers in S contained within the interval. For any constant ε>0, our range counting data structure returns in constant time an approximate answer which is within a factor of at most 1+ε of the correct answer.
Copyright noticeCopyright © 2001 by the Association for Computer Machinery, Inc.
Online version
stoc01.pdf (153 Kb)
DOI
Slidesstoc01.pdf (199 Kb)
BIBT_{E}X entry
@inproceedings{stoc01, author = "Stephen Alstrup and Gerth St{\o}lting Brodal and Theis Rauhe", booktitle = "Proc. 33rd Annual ACM Symposium on Theory of Computing", doi = "10.1145/380752.380842", isbn = "1-58113-349-9", pages = "476-482", title = "Optimal Static Range Reporting in One Dimension", year = "2001" }
Other versions