Succinct and Compressed Data Structures
Prof. Rajeev Raman
University of Leicester
There are now good reasons to be re-assessing the space requirements of
data structures. This survey will address the following questions:
- What space bounds should we be aiming to achieve?
- How do we achieve these space bounds and allow efficient operations?
We will be using large text indices and XML data as motivating
examples.