Back to papers
Revisiting B-tree Compression: An Experimental Study
Summary: First head-to-head experimental study of 7 classic B-tree compression schemes, spanning synthetic and real workloads. Quantifies when compression actually helps (space, cache/I/O, query speed) and distills design guidance for modern index systems.
(summarized by gpt-5.4-mini on May 24 2026)
- Paper ID
- 6933
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.3399748e-05
- Overall Rank
- 9,410 | 34.61%
- DOI
-
10.1145/3654972
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 87 |
Hekaton: SQL Server’s Memory-Optimized OLTP Engine |
2013 |
SIGMOD |
0.00052844656 |
| 101 |
The Case for Learned Index Structures |
2018 |
SIGMOD |
0.00049778866 |
| 132 |
Integrating Compression and Execution in Column-Oriented Database Systems |
2006 |
SIGMOD |
0.00043697853 |
| 136 |
H-Store: A High-Performance, Distributed Main Memory Transaction Processing System |
2008 |
VLDB |
0.00042409816 |
| 211 |
Gorilla: A Fast, Scalable, In-Memory Time Series Database |
2015 |
VLDB |
0.0003401421 |
| 382 |
FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs |
2010 |
SIGMOD |
0.00024888997 |
| 819 |
ALEX: An Updatable Adaptive Learned Index |
2020 |
SIGMOD |
0.00016237497 |
| 1,098 |
Query Optimization In Compressed Database Systems |
2001 |
SIGMOD |
0.00014070252 |
| 1,134 |
Dictionary-based Order-preserving String Compression for Main Memory Column Stores |
2009 |
SIGMOD |
0.00013751593 |
| 1,807 |
Main-Memory Index Structures with Fixed-Size Partial Keys |
2001 |
SIGMOD |
0.0001047644 |
| 1,834 |
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks |
2019 |
SIGMOD |
0.00010364718 |
| 2,619 |
Decomposed Bounded Floats for Fast Compression and Queries |
2021 |
VLDB |
8.4427442e-05 |
| 2,821 |
An Experimental Study of Bitmap Compression vs. Inverted List Compression |
2017 |
SIGMOD |
8.0639288e-05 |
| 2,863 |
Efficient Index Compression in DB2 LUW |
2009 |
VLDB |
7.9982677e-05 |
| 3,153 |
AnalyticDB: Real-time OLAP Database System at Alibaba Cloud |
2019 |
VLDB |
7.4706916e-05 |
| 5,847 |
Order-Preserving Key Compression for In-Memory Search Trees |
2020 |
SIGMOD |
5.3040014e-05 |
| 7,160 |
MILC: Inverted List Compression in Memory |
2017 |
VLDB |
4.8088037e-05 |
| 7,431 |
CompressDB: Enabling Efficient Compressed Data Direct Processing for Various Databases |
2022 |
SIGMOD |
4.7274757e-05 |
| 7,990 |
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees |
2023 |
VLDB |
4.6086117e-05 |
| 8,424 |
Tree-Encoded Bitmaps |
2020 |
SIGMOD |
4.5111681e-05 |
| 8,584 |
FCBench: Cross-Domain Benchmarking of Lossless Compression for Floating-Point Data |
2024 |
VLDB |
4.4857511e-05 |
| 9,664 |
A Compact B-tree |
2002 |
SIGMOD |
4.3045685e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,380 |
B-Trees Are Back: Engineering Fast and Pageable Node Layouts |
2025 |
SIGMOD |
4.1905499e-05 |
| 13,086 |
Experiments With B-Tree Reorganization |
1980 |
SIGMOD |
4.1905499e-05 |
| 3,501 |
A New Compression Method with Fast Searching on Large Databases |
1987 |
VLDB |
7.033534e-05 |
| 1,098 |
Query Optimization In Compressed Database Systems |
2001 |
SIGMOD |
0.00014070252 |
| 14,362 |
Multi-Table Search For B-Tree Files |
1979 |
SIGMOD |
- |
| 6,473 |
Efficient Search of Multidimensional B-Trees |
1995 |
VLDB |
5.0427056e-05 |
| 4,317 |
Compact B-Trees |
1979 |
SIGMOD |
6.2824978e-05 |
| 14,292 |
An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees |
1984 |
SIGMOD |
- |
| 2,821 |
An Experimental Study of Bitmap Compression vs. Inverted List Compression |
2017 |
SIGMOD |
8.0639288e-05 |
| 9,499 |
Memory-Efficient Search Trees for Database Management Systems |
2021 |
SIGMOD |
4.3300131e-05 |