2026-07-25T09:32:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17955 2024-03-06T11:00:42Z ddc:004 open_access

Trie-Compressed Adaptive Set Intersection Arroyuelo, Diego Castillo, Juan Pablo Set intersection problem Adaptive Algorithms Compressed and compact data structures 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Diego Arroyuelo and Juan Pablo Castillo 2023 Is Part Of LIPIcs, Volume 259, 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CPM.2023.1 urn:nbn:de:0030-drops-179552 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.1 eng https://creativecommons.org/licenses/by/4.0/legalcode