DBScholar

Back to papers

Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes

Summary: Two-stage hybrid index for main-memory OLTP: a small ingest-first stage, with periodic migration to a compact, read-optimized second stage. DST shows how to convert any order-preserving index into a hybrid index; applied to four structures, achieving up to 70% memory reduction with comparable throughput. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
heaf51fbd80a81d19
Venue
SIGMOD
Year
2016
Pagerank
0.00012798312
Overall Rank
964 | 93.54%
DOI
10.1145/2882903.2915222

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_sigmod16,
        title = {{Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes}},
        author = {Zhang, Huanchen and Kaminsky, Michael and Andersen, David G. and Ma, Lin and Shen, Rui and Pavlo, Andrew},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2915222},
        url = {https://dl.acm.org/doi/10.1145/2882903.2915222},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 40 of 40 citing papers.

Rank Citing Paper Year Venue Pagerank
40 The Case for Learned Index Structures 2018 SIGMOD 0.00046249672
774 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.00014063511
892 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013207671
906 HOT: A Height Optimized Trie Index for Main-Memory Database Systems 2018 SIGMOD 0.00013129817
1,328 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 0.00011013165
1,366 Dash: Scalable Hashing on Persistent Memory 2020 VLDB 0.00010879316
1,370 Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks 2019 SIGMOD 0.00010875068
1,400 Magic mirror in my hand, which is the best in the land? An Experimental Evaluation of Index Selection Algorithms 2020 VLDB 0.00010759064
2,249 Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations 2019 SIGMOD 8.7479608e-05
2,254 FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems 2022 VLDB 8.7429699e-05
2,288 DPTree: Differential Indexing for Persistent Memory 2020 VLDB 8.6817411e-05
2,590 Are Updatable Learned Indexes Ready? 2022 VLDB 8.2368464e-05
2,755 Evaluating Persistent Memory Range Indexes 2020 VLDB 8.0383029e-05
2,870 APEX: A High-Performance Learned Index on Persistent Memory 2022 VLDB 7.9033232e-05
3,606 Access Path Selection in Main-Memory Optimized Data Systems: Should I Scan or Should I Probe? 2017 SIGMOD 7.1528863e-05
3,716 CARMI: A Cache-Aware Learned Index with a Cost-based Construction Algorithm 2022 VLDB 7.0541948e-05
4,092 Fast Algorithms for Denial Constraint Discovery 2023 VLDB 6.7958327e-05
5,225 LeanStore: A High-Performance Storage Engine for NVMe SSDs 2024 VLDB 6.2100105e-05
5,398 Order-Preserving Key Compression for In-Memory Search Trees 2020 SIGMOD 6.1338952e-05
5,421 FILM: a Fully Learned Index for Larger-than-Memory Databases 2023 VLDB 6.1231965e-05
6,075 When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories 2023 SIGMOD 5.8776022e-05
6,622 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 5.7136886e-05
6,802 SALI: A Scalable Adaptive Learned Index Framework based on Probability Models 2023 SIGMOD 5.6623052e-05
6,839 Zen: a High-Throughput Log-Free OLTP Engine for Non-Volatile Main Memory 2021 VLDB 5.6514035e-05
7,044 SepHash: A Write-Optimized Hash Index On Disaggregated Memory via Separate Segment Structure 2024 VLDB 5.5978251e-05
7,049 BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees 2023 VLDB 5.5967284e-05
7,180 Adaptive Hybrid Indexes 2022 SIGMOD 5.5767825e-05
7,516 B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases 2023 VLDB 5.4896042e-05
8,091 Two is Better Than One: The Case for 2-Tree for Skewed Data Sets 2023 CIDR 5.3744333e-05
8,195 Hyperion: Building the Largest In-memory Search Tree 2019 SIGMOD 5.3639085e-05
8,443 Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store 2025 SIGMOD 5.3148581e-05
8,589 Robust and Budget-Constrained Encoding Configurations for In-Memory Database Systems 2022 VLDB 5.2937865e-05
9,814 Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis] 2026 SIGMOD 5.1121061e-05
10,366 SCompression: Enhancing Database Knob Tuning Efficiency Through Slice-Based OLTP Workload Compression 2025 VLDB 5.0091669e-05
10,417 Replace or Augment: Rethinking the Role of Learned Indexes in Relational Databases 2027 VLDB 4.9605343e-05
10,798 SIDLE: Tree-structure Aware Indexes for CXL-based Heterogeneous Memory 2026 VLDB 4.9605343e-05
11,191 VEGA: An Active-tuning Learned Index with Group-Wise Learning Granularity 2025 SIGMOD 4.9605343e-05
11,301 FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update 2025 VLDB 4.9605343e-05
11,633 Blitzcrank: Fast Semantic Compression for In-memory Online Transaction Processing 2024 VLDB 4.9605343e-05
12,227 HERMIT in Action: Succinct Secondary Indexing Mechanism via Correlation Exploration 2019 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers