compact data structure


Definition: A data structure that needs far less space with efficient access without decompression.

Generalization (I am a kind of ...)
data structure.

Specialization (... is a kind of me.)

Note: A compact data structure may allow the entire structure to fit in main memory, efficient secondary-memory algorithms, streaming algorithms, or efficient distributed algorithms.

Author: PEB

More information

Gonzalo Navarro, Compact Data Structures: A practical approach, Cambridge University Press, 2016. DOI: 10.1017/CBO9781316588284

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 8 June 2023.
HTML page formatted Wed Aug 9 16:21:12 2023.

Cite this as:
Paul E. Black, "compact data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 8 June 2023. (accessed TODAY) Available from: