2381/29206
Arash Farzan
Arash
Farzan
J. Ian Munro
J. Ian
Munro
Rajeev Raman
Rajeev
Raman
Succinct indices for range queries with applications to orthogonal range maxima
University of Leicester
2014
IR content
2014-10-28 10:40:48
Conference contribution
https://figshare.le.ac.uk/articles/conference_contribution/Succinct_indices_for_range_queries_with_applications_to_orthogonal_range_maxima/10146713
We consider the problem of preprocessing N points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the effective entropy of range maxima queries and succinct indices for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in O(logN loglogN) time. This a direct improvement of Chazelle's result from 1985 [10] for this problem - Chazelle required O(N/ε) words to answer queries in O((logN)[superscript 1+ε]) time for any constant ε > 0.