Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data
Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer
Abstract
We propose a robust index for semi-structured hierarchical data that supports content-and-structure (CAS) queries specified by path and value predicates. At the heart of our approach is a novel dynamic interleaving scheme that merges the path and value dimensions of composite keys in a balanced way. We store these keys in our trie-based Robust Content-And-Structure index, which efficiently supports a wide range of CAS queries, including queries with wildcards and descendant axes. Additionally, we show important properties of our scheme, such as robustness against varying selectivities, and demonstrate improvements of up to two orders of magnitude over existing approaches in our experimental evaluation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Constant-time snapshots with applications to concurrent data structuresYuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou et al.PPoPP 2021 · 37 citations
- PathCAS: an efficient middle ground for concurrent search data structuresTrevor Brown, William Sigouin, Dan AlistarhPPoPP 2022 · 4 citations
- Non-blocking interpolation search trees with doubly-logarithmic running timeTrevor Brown, Aleksandar Prokopec, Dan AlistarhPPoPP 2020 · 29 citations
- Hierarchical Retrieval at Scale: Bridging Interpretability and EfficiencyShubham Gupta, Zichao Li, Tianyi Chen, Cem Subakan et al.ICML 2026
- Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM IndexingAdar Zeitak, Adam MorrisonSOSP 2021 · 13 citations
