Trie-Compressed Adaptive Set Intersection
| Autor: | Arroyuelo, Diego, Castillo, Juan Pablo |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: |
Theory of computation → Design and analysis of algorithms
Theory of computation → Data structures and algorithms for data management Compressed and compact data structures Set intersection problem Information systems → Information retrieval query processing Theory of computation → Data compression Adaptive Algorithms |
| DOI: | 10.4230/lipics.cpm.2023.1 |
| Popis: | We introduce space- and time-efficient algorithms and data structures for the offline set intersection problem. We show that a sorted integer set S ⊆ [0..u) of n elements can be represented using compressed space while supporting k-way intersections in adaptive O(kδlg(u/δ)) time, δ being the alternation measure introduced by Barbay and Kenyon. Our experimental results suggest that our approaches are competitive in practice, outperforming the most efficient alternatives (Partitioned Elias-Fano indexes, Roaring Bitmaps, and Recursive Universe Partitioning (RUP)) in several scenarios, offering in general relevant space-time trade-offs. LIPIcs, Vol. 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), pages 1:1-1:19 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|