## Succinct indexes for strings, binary relations and multi-labeled trees (2007)

### Cached

### Download Links

- [users.dcc.uchile.cl]
- [www.cs.uwaterloo.ca]
- DBLP

### Other Repositories/Bibliography

Venue: | In Procs ACM-SIAM SODA, 2007 (this volume |

Citations: | 41 - 12 self |

### BibTeX

@INPROCEEDINGS{Barbay07succinctindexes,

author = {Jérémy Barbay and Meng He and J. Ian Munro and S. Srinivasa Rao},

title = {Succinct indexes for strings, binary relations and multi-labeled trees},

booktitle = {In Procs ACM-SIAM SODA, 2007 (this volume},

year = {2007},

pages = {680--689}

}

### Years of Citing Articles

### OpenURL

### Abstract

We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures called succinct indexes that occupy asymptotically less space than the information-theoretic lower bound on the space required to encode the given data, and support an extended set of operations using the basic operators defined in the ADT. As opposed to succinct encodings, The main advantage of succinct indexes is that we make assumptions only on the ADT through which the main data is accessed, rather than the way in which the data is encoded. This allows more freedom in the encoding of the main data. In this paper, we present succinct indexes for various data types, namely strings, binary relations and multi-labeled trees. Given the support for the interface of the ADTs of these data types, we can support various useful operations efficiently by constructing succinct indexes for them. When the operators in the ADTs are supported in constant time, our results are comparable to previous results, while allowing more flexibility in the encoding of the given data. Using our techniques, we design the first succinct encoding that represents a string of length n over alphabet [σ] using nHk + o(n lg σ) bits 1 that support access / rank / select operations in o((lg lg σ) 3) time. We also design the first succinct text index using nHk + o(n lg σ) bits that supports pattern matching queries in O(m lg lg σ + occ lg 1+ɛ n lg lg σ) time, for a given pattern of length m. Previous results on these two problems either have a lg σ factor instead of lg lg σ in terms of running time, or are not compressible, but our results do not have such problems. More results are reported in the paper. 1 We use lg n to denote ⌈log2 n⌉. 1