Sciweavers

WADS
2009
Springer

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

14 years 6 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range reporting in O(k lg n/ lg lg n) time, where k is the size of the output. This achieves an improvement on query time by a factor of lg lg n upon the previous result of M¨akinen and Navarro [1], while using essentially the information-theoretic minimum space. Our data structure not only can be used as a key component in solutions to the general orthogonal range search problem to save storage cost, but also has applications in text indexing. In particular, we apply it to improve two previous space-efficient text indexes that support substring search [2] and position-restricted substring search [1]. We also use it to extend previous results on succinct representations of sequences of small integers, and to design succinct data structures supporting certain types of orthogonal range query in the plane.
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WADS
Authors Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
Comments (0)