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
- 6932
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.3441378e-05
- Overall Rank
- 9,404 | 34.58%
- 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.00052389723 |
| 102 |
The Case for Learned Index Structures |
2018 |
SIGMOD |
0.00049545203 |
| 131 |
Integrating Compression and Execution in Column-Oriented Database Systems |
2006 |
SIGMOD |
0.0004370331 |
| 137 |
H-Store: A High-Performance, Distributed Main Memory Transaction Processing System |
2008 |
VLDB |
0.00042342967 |
| 210 |
Gorilla: A Fast, Scalable, In-Memory Time Series Database |
2015 |
VLDB |
0.0003404384 |
| 381 |
FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs |
2010 |
SIGMOD |
0.00024873637 |
| 826 |
ALEX: An Updatable Adaptive Learned Index |
2020 |
SIGMOD |
0.00016224841 |
| 1,100 |
Query Optimization In Compressed Database Systems |
2001 |
SIGMOD |
0.00014072277 |
| 1,134 |
Dictionary-based Order-preserving String Compression for Main Memory Column Stores |
2009 |
SIGMOD |
0.00013761456 |
| 1,809 |
Main-Memory Index Structures with Fixed-Size Partial Keys |
2001 |
SIGMOD |
0.00010483957 |
| 1,852 |
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks |
2019 |
SIGMOD |
0.00010322492 |
| 2,613 |
Decomposed Bounded Floats for Fast Compression and Queries |
2021 |
VLDB |
8.4503824e-05 |
| 2,856 |
Efficient Index Compression in DB2 LUW |
2009 |
VLDB |
8.0056412e-05 |
| 2,862 |
An Experimental Study of Bitmap Compression vs. Inverted List Compression |
2017 |
SIGMOD |
7.9898539e-05 |
| 3,152 |
AnalyticDB: Real-time OLAP Database System at Alibaba Cloud |
2019 |
VLDB |
7.4711766e-05 |
| 5,835 |
Order-Preserving Key Compression for In-Memory Search Trees |
2020 |
SIGMOD |
5.30905e-05 |
| 7,416 |
MILC: Inverted List Compression in Memory |
2017 |
VLDB |
4.7355258e-05 |
| 7,429 |
CompressDB: Enabling Efficient Compressed Data Direct Processing for Various Databases |
2022 |
SIGMOD |
4.7320139e-05 |
| 7,995 |
BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees |
2023 |
VLDB |
4.6109825e-05 |
| 8,430 |
Tree-Encoded Bitmaps |
2020 |
SIGMOD |
4.5154973e-05 |
| 8,588 |
FCBench: Cross-Domain Benchmarking of Lossless Compression for Floating-Point Data |
2024 |
VLDB |
4.4900555e-05 |
| 9,664 |
A Compact B-tree |
2002 |
SIGMOD |
4.3086973e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,368 |
B-Trees Are Back: Engineering Fast and Pageable Node Layouts |
2025 |
SIGMOD |
4.1945683e-05 |
| 13,073 |
Experiments With B-Tree Reorganization |
1980 |
SIGMOD |
4.1945683e-05 |
| 3,497 |
A New Compression Method with Fast Searching on Large Databases |
1987 |
VLDB |
7.0390264e-05 |
| 1,100 |
Query Optimization In Compressed Database Systems |
2001 |
SIGMOD |
0.00014072277 |
| 14,348 |
Multi-Table Search For B-Tree Files |
1979 |
SIGMOD |
- |
| 6,480 |
Efficient Search of Multidimensional B-Trees |
1995 |
VLDB |
5.0475112e-05 |
| 4,324 |
Compact B-Trees |
1979 |
SIGMOD |
6.2885419e-05 |
| 14,278 |
An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees |
1984 |
SIGMOD |
- |
| 2,862 |
An Experimental Study of Bitmap Compression vs. Inverted List Compression |
2017 |
SIGMOD |
7.9898539e-05 |
| 9,498 |
Memory-Efficient Search Trees for Database Management Systems |
2021 |
SIGMOD |
4.3341665e-05 |