DBScholar

Back to papers

Adaptive Hybrid Indexes

Summary: Adaptive hybrid indexes: run-time encoding decisions via query sampling, supporting multiple encodings per index. Evaluated on B+-trees and tries; up to 82% space reduction with >90% baseline performance on skewed workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hc59845ab89c2dcd4
Venue
SIGMOD
Year
2022
Pagerank
5.597934e-05
Overall Rank
7,154 | 51.91%
DOI
10.1145/3514221.3526121

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{anneser_sigmod22,
        title = {{Adaptive Hybrid Indexes}},
        author = {Anneser, Christoph and Kipf, Andreas and Zhang, Huanchen and Neumann, Thomas and Kemper, Alfons},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3526121},
        url = {https://dl.acm.org/doi/10.1145/3514221.3526121},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
40 The Case for Learned Index Structures 2018 SIGMOD 0.00046284649
224 Self-Driving Database Management Systems 2017 CIDR 0.00024013745
373 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00019711632
430 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00018409112
463 The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds 2020 VLDB 0.00017804544
472 Skew-Aware Automatic Database Partitioning in Shared-Nothing, Parallel OLTP Systems 2012 SIGMOD 0.00017692264
779 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.00014030069
848 Benchmarking Learned Indexes 2021 VLDB 0.00013506188
891 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013245926
906 Data Blocks: Hybrid OLTP and OLAP on Compressed Storage using both Vectorization and Compilation 2016 SIGMOD 0.00013160654
971 Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes 2016 SIGMOD 0.00012766019
1,320 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 0.00011045319
1,439 Continuous Monitoring of Top-k Queries over Sliding Windows 2006 SIGMOD 0.00010642846
1,550 Updatable Learned Index with Precise Positions 2021 VLDB 0.00010282449
3,308 Compacting Transactional Data in Hybrid OLTP&OLAP Databases 2012 VLDB 7.4411187e-05
5,397 Order-Preserving Key Compression for In-Memory Search Trees 2020 SIGMOD 6.1490013e-05
6,530 Contention and Space Management in B-Trees 2021 CIDR 5.7549598e-05
Previous Page 1 / 1 Next

Semantically Similar Papers