Compressed Set Representations based on Set Difference
arXiv:2601.23240
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.
To be presented at LATIN 2026