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.0001283613
Overall Rank
960 | 93.55%
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.00046363107
768 FITing-Tree: A Data-aware Index Structure 2019 SIGMOD 0.00014107655
889 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013243846
904 HOT: A Height Optimized Trie Index for Main-Memory Database Systems 2018 SIGMOD 0.00013170142
1,316 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 0.00011046804
1,359 Dash: Scalable Hashing on Persistent Memory 2020 VLDB 0.00010914954
1,366 Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks 2019 SIGMOD 0.00010908555
1,396 Magic mirror in my hand, which is the best in the land? An Experimental Evaluation of Index Selection Algorithms 2020 VLDB 0.00010788714
2,237 Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations 2019 SIGMOD 8.7738349e-05
2,270 FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems 2022 VLDB 8.7166469e-05
2,277 DPTree: Differential Indexing for Persistent Memory 2020 VLDB 8.7072748e-05
2,582 Are Updatable Learned Indexes Ready? 2022 VLDB 8.2641447e-05
2,742 Evaluating Persistent Memory Range Indexes 2020 VLDB 8.0645378e-05
2,861 APEX: A High-Performance Learned Index on Persistent Memory 2022 VLDB 7.9295281e-05
3,597 Access Path Selection in Main-Memory Optimized Data Systems: Should I Scan or Should I Probe? 2017 SIGMOD 7.1759026e-05
3,710 CARMI: A Cache-Aware Learned Index with a Cost-based Construction Algorithm 2022 VLDB 7.0775695e-05
4,070 Fast Algorithms for Denial Constraint Discovery 2023 VLDB 6.8183785e-05
5,221 LeanStore: A High-Performance Storage Engine for NVMe SSDs 2024 VLDB 6.2207378e-05
5,388 Order-Preserving Key Compression for In-Memory Search Trees 2020 SIGMOD 6.1520776e-05
5,405 FILM: a Fully Learned Index for Larger-than-Memory Databases 2023 VLDB 6.1435108e-05
6,070 When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories 2023 SIGMOD 5.8940295e-05
6,613 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 5.7326443e-05
6,787 SALI: A Scalable Adaptive Learned Index Framework based on Probability Models 2023 SIGMOD 5.6810904e-05
7,004 Zen: a High-Throughput Log-Free OLTP Engine for Non-Volatile Main Memory 2021 VLDB 5.621848e-05
7,023 SepHash: A Write-Optimized Hash Index On Disaggregated Memory via Separate Segment Structure 2024 VLDB 5.6163964e-05
7,029 BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees 2023 VLDB 5.6152961e-05
7,157 Adaptive Hybrid Indexes 2022 SIGMOD 5.595284e-05
7,498 B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases 2023 VLDB 5.5078165e-05
8,075 Two is Better Than One: The Case for 2-Tree for Skewed Data Sets 2023 CIDR 5.3921263e-05
8,179 Hyperion: Building the Largest In-memory Search Tree 2019 SIGMOD 5.3816264e-05
8,427 Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store 2025 SIGMOD 5.3324907e-05
8,570 Robust and Budget-Constrained Encoding Configurations for In-Memory Database Systems 2022 VLDB 5.3113492e-05
9,782 Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis] 2026 SIGMOD 5.129066e-05
10,340 SCompression: Enhancing Database Knob Tuning Efficiency Through Slice-Based OLTP Workload Compression 2025 VLDB 5.0257853e-05
10,350 Replace or Augment: Rethinking the Role of Learned Indexes in Relational Databases 2027 VLDB 4.9769913e-05
10,737 SIDLE: Tree-structure Aware Indexes for CXL-based Heterogeneous Memory 2026 VLDB 4.9769913e-05
11,131 VEGA: An Active-tuning Learned Index with Group-Wise Learning Granularity 2025 SIGMOD 4.9769913e-05
11,245 FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update 2025 VLDB 4.9769913e-05
11,585 Blitzcrank: Fast Semantic Compression for In-memory Online Transaction Processing 2024 VLDB 4.9769913e-05
12,184 HERMIT in Action: Succinct Secondary Indexing Mechanism via Correlation Exploration 2019 VLDB 4.9769913e-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