paper329.pdf (339.88 kB)
Download file

Succinct indices for range queries with applications to orthogonal range maxima

Download (339.88 kB)
conference contribution
posted on 28.10.2014, 10:40 by Arash Farzan, J. Ian Munro, Rajeev Raman
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.

History

Citation

Automata, Languages, and Programming, Lecture Notes in Computer Science, 2012, 7391 LNCS (PART 1), pp. 327-338

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012

Version

AM (Accepted Manuscript)

Published in

Automata

Publisher

Springer Berlin Heidelberg

issn

0302-9743

eissn

1611-3349

isbn

978-3-642-31593-0;978-3-642-31594-7

Copyright date

2012

Available date

28/10/2014

Publisher version

http://link.springer.com/chapter/10.1007/978-3-642-31594-7_28

Book series

Lecture Notes in Computer Science;7391

Language

en

Usage metrics

Categories

Keywords

Exports