Succinct indexes for strings, binary relations and multi-labeled trees

@inproceedings{Barbay2007SuccinctIF,
  title={Succinct indexes for strings, binary relations and multi-labeled trees},
  author={J{\'e}r{\'e}my Barbay and Meng He and J. Ian Munro and S. Srinivasa Rao},
  booktitle={SODA},
  year={2007}
}
We define and design succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures 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 (integrated data/index) encodings, the main advantage of succinct indexes is that we make assumptions only on the ADT through… CONTINUE READING