Compressed Set Representations based on Set Difference
Data Structures and Algorithms
2026-02-02 v1
Abstract
We introduce a compressed representation of sets of sets that exploits how much they differ from each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. In addition, we give a new MST-based construction algorithm for the representation that outperforms standard ones.
Cite
@article{arxiv.2601.23240,
title = {Compressed Set Representations based on Set Difference},
author = {Travis Gagie and Meng He and Gonzalo Navarro},
journal= {arXiv preprint arXiv:2601.23240},
year = {2026}
}
Comments
To be presented at LATIN 2026