License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2023.1
URN: urn:nbn:de:0030-drops-179552
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17955/
Arroyuelo, Diego ;
Castillo, Juan Pablo
Trie-Compressed Adaptive Set Intersection
Abstract
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.
BibTeX - Entry
@InProceedings{arroyuelo_et_al:LIPIcs.CPM.2023.1,
author = {Arroyuelo, Diego and Castillo, Juan Pablo},
title = {{Trie-Compressed Adaptive Set Intersection}},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},
pages = {1:1--1:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-276-1},
ISSN = {1868-8969},
year = {2023},
volume = {259},
editor = {Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17955},
URN = {urn:nbn:de:0030-drops-179552},
doi = {10.4230/LIPIcs.CPM.2023.1},
annote = {Keywords: Set intersection problem, Adaptive Algorithms, Compressed and compact data structures}
}
