Compact Data Structures
A Practical Approach

AUTHOR: Gonzalo Navarro, Universidad de Chile



Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential tools for efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed deployments and make better use of the limited memory in low-end devices. The field has developed rapidly, reaching a level of maturity that allows practitioners and researchers in application areas to benefit from the use of compact data structures. This first comprehensive book on the topic focuses on the structures that are most relevant for practical use. Readers will learn how the structures work, how to choose the right ones for their application scenario, and how to implement them. Researchers and students in the area will find in the book a definitive guide to the state of the art in compact data structures.

• Focuses on structures that are stable, mature, and proven, or likely to be useful in practice, with many example applications
• Gives pseudocode for all the relevant procedures
• Thorough bibliographic discussions at the end of each chapter point readers to recent research, advanced concepts, and the best theoretical results

Table of Contents

1. Introduction
2. Entropy and coding
3. Arrays
4. Bitvectors
5. Permutations
6. Sequences
7. Parentheses
8. Trees
9. Graphs
10. Grids
11. Texts
12. Dynamic structures
13. Recent trends.