Compressed Set Representations based on Set Difference
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910006321872896 |
|---|---|
| author | Gagie, Travis He, Meng Navarro, Gonzalo |
| author_facet | Gagie, Travis He, Meng Navarro, Gonzalo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_23240 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Compressed Set Representations based on Set Difference Gagie, Travis He, Meng Navarro, Gonzalo Data Structures and Algorithms 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. |
| title | Compressed Set Representations based on Set Difference |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2601.23240 |