# On dynamic range reporting in one dimension

@inproceedings{Mortensen2005OnDR,
title={On dynamic range reporting in one dimension},
author={Christian Worm Mortensen and R. Pagh and Mihai Patrascu},
booktitle={STOC '05},
year={2005}
}
• Published in STOC '05 5 February 2005
• Computer Science, Mathematics
We consider the problem of maintaining a dynamic set of integers and answering queries of the form: report a point (equivalently, all points) in a given interval. Range searching is a natural and fundamental variant of integer search, and can be solved using predecessor search. However, for a RAM with w-bit words, we show how to perform updates in O(lg w) time and answer queries in O(lg lg w) time. The update time is identical to the van Emde Boas structure, but the query time is exponentially…

## Figures from this paper

Persistent predecessor search and orthogonal point location on the word RAM
This work presents a (partially) persistent data structure that supports predecessor search in a set of integers in {1,...,U} under an arbitrary sequence of n insertions and deletions, with O(log log U) expected query time and expected amortized update time, and O(n) space.
Dynamic Indexability and the Optimality of B-Trees
• K. Yi
• Computer Science
JACM
• 2012
This article proves that the query-update tradeoffs of all the known dynamic B-trees are optimal, when logB NM is a constant, which implies that one should not hope for substantially better solutions for all practical values of the parameters.
Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries
• K. Yi
• Computer Science
ArXiv
• 2008
It is proved that for any dynamic one-dimensional range query index structure with query cost £O(q+\frac{K}{B})$and amortized insertion cost$O(u/B)$, the tradeoff$q\cdot \log (u/q) = \Omega(\log B)$must hold if$q=O(\ log B)\$.
Lower bound techniques for data structures
We describe new techniques for proving lower bounds on data-structure problems, with the following broad consequences: (1) the first Ω(lg n) lower bound for any dynamic problem, improving on a bound
Succinct Data Structures for Retrieval and Approximate Membership
• Computer Science
ICALP
• 2008
It is shown that for any k, query time O(k) can be beachieved using space that is within a factor 1 + e-k of optimal, asymptotically forlarge n.
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
• Computer Science
STOC '10
• 2010
It is shown that the query complexities of many problems such as 1D-range counting, predecessor, rank-select, and many others, are all the same in the regime where the amortized update time is less than 1, as long as the cell size is large enough (b = polylog(n) suffices).
Orthogonal Range Searching in Linear and Almost-Linear Space
This paper presents a dynamic linear space data structure that supports orthogonal range reporting queries in O(log n + k loge n) time, where k is the size of the answer and achieves sub-logarithmic query time.
Substring Range Reporting
• Computer Science
CPM
• 2011
This work revisits various string indexing problems with range reporting features, namely, position-restricted substring searching, indexing substrings with gaps, and indexingSubstrings with intervals, and gives efficient reductions for each problem to a new problem, which is called substring range reporting.
Dynamic Data Structures for Document Collections and Graphs
• Computer Science
PODS
• 2015
It is demonstrated that the gap between static and dynamic variants of the indexing problem can be almost closed, based on a novel framework for adding dynamism to static compressed data structures.

## References

SHOWING 1-10 OF 18 REFERENCES
Succinct Dynamic Dictionaries and Trees
• Computer Science
ICALP
• 2003
It is shown that a binary tree on n nodes, where each node has b = O(lg n)-bit data stored at it, can be maintained under node insertions while supporting navigation in O(1) time and updates in O((lg lg n)1+Ɛ) amortised time, for any constant Ɛ > 0.
Optimal static range reporting in one dimension
• Computer Science
STOC '01
• 2001
This work considers static one dimensional range searching problems and presents an optimal data structure with linear space cost and with query time linear in the number of integers reported for the query of reporting all integers in S</italic contained within a query interval.
The Bloomier filter: an efficient data structure for static support lookup tables
• Computer Science
SODA '04
• 2004
The Bloomier filter is introduced, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries and lower bounds are provided to prove the (near) optimality of the constructions.
Optimal Bounds for the Predecessor Problem and Related Problems
• Mathematics, Computer Science
J. Comput. Syst. Sci.
• 2002
The lower bounds are proved for a large class of problems, including both static and dynamic predecessor problems, in a much stronger communication game model, but they apply to the cell probe and RAM models.
On data structures and asymmetric communication complexity
• Computer Science
STOC '95
• 1995
This paper considers two-party communication complexity, the asymmetric case'', when the input sizes of the two players differ significantly, and derives two generally applicable methods of proving lower bounds and obtain several applications.
The Complexity of Maintaining an Array and Computing Its Partial Sums
A trade-off between the complexmes of (a) versus (b) is observed, and the informatlon-theoreuc complexity measure counts the number of accesses and changes to a random access memory.
Chernoff-Hoeffding bounds for applications with limited independence
• Computer Science, Mathematics
SODA '93
• 1993
The limited independence result implies that a reduced amount and weaker sources of randomness are sufficient for randomized algorithms whose analyses use the CH bounds, e.g., the analysis of randomized algorithms for random sampling and oblivious packet routing.
Exact and approximate membership testers
• Mathematics
STOC
• 1978
The question of how much space is needed to represent a set is considered, given a finite universe U and some subset V and a procedure that for each element s in U determines if s is in V.
Dispersing Hash Functions
• R. Pagh
• Mathematics, Computer Science
• 2000
A new hashing primitive is introduced: dispersing hash functions and a tight relationship between dispersing families and extractors is exhibited, and the related issue of program size for hash functions which are nearly perfect is investigated.
An optimal Bloom filter replacement
• Computer Science
SODA '05
• 2005
A new RAM data structure is considered for storing an approximation of S to S such that S ⊆ S and any element not in S belongs to S with probability at most ∈, and the space usage is within a lower order term of the lower bound.