compact data structure

(definition)

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

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

Specialization (... is a kind of me.)
k²-tree.

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 20 September 2024.
HTML page formatted Fri Sep 20 10:12:02 2024.

Cite this as:
Paul E. Black, "compact data structure", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 20 September 2024. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/compactDataStruct.html