Back to papers
Order-Preserving Key Compression for In-Memory Search Trees
Summary: HOPE is a fast, order-preserving dictionary encoder for in-memory search trees, compressing arbitrary keys with a compact dictionary. A theory-driven model selects six schemes, evaluated on SuRF, ART, HOT, B+Tree, and Prefix B+Tree, delivering up to 40% latency reduction and 30% memory savings for string workloads.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5796
- Venue
- SIGMOD
- Year
- 2020
- Pagerank
- 5.30905e-05
- Overall Rank
- 5,835 | 59.41%
- DOI
-
10.1145/3318464.3380583
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 3,416 |
LeCo: Lightweight Compression via Learning Serial Correlations |
2024 |
SIGMOD |
7.1196234e-05 |
| 4,227 |
Cosine: A Cloud-Cost Optimized Self-Designing Key-Value Storage Engine |
2022 |
VLDB |
6.3434324e-05 |
| 4,514 |
An Empirical Evaluation of Columnar Storage Formats |
2024 |
VLDB |
6.1204636e-05 |
| 6,367 |
Good to the Last Bit: Data-Driven Encoding with CodecDB |
2021 |
SIGMOD |
5.0941072e-05 |
| 7,869 |
SALI: A Scalable Adaptive Learned Index Framework based on Probability Models |
2023 |
SIGMOD |
4.6315248e-05 |
| 7,894 |
LITS: An Optimized Learned Index for Strings |
2024 |
VLDB |
4.6240341e-05 |
| 8,101 |
Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction |
2024 |
SIGMOD |
4.5854141e-05 |
| 8,655 |
Adaptive Hybrid Indexes |
2022 |
SIGMOD |
4.4739554e-05 |
| 9,201 |
F3: The Open-Source Data File Format for the Future |
2026 |
SIGMOD |
4.3743539e-05 |
| 9,404 |
Revisiting B-tree Compression: An Experimental Study |
2024 |
SIGMOD |
4.3441378e-05 |
| 9,595 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
4.3194469e-05 |
| 9,645 |
The FastLanes File Format |
2025 |
VLDB |
4.3109001e-05 |
| 10,257 |
SIDLE: Tree-structure Aware Indexes for CXL-based Heterogeneous Memory |
2026 |
VLDB |
4.1945683e-05 |
| 10,484 |
Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,036 |
Blitzcrank: Fast Semantic Compression for In-memory Online Transaction Processing |
2024 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 86 |
The End of an Architectural Era (It's Time for a Complete Rewrite) |
2007 |
VLDB |
0.00052563276 |
| 103 |
Making B+-Trees Cache Conscious in Main Memory |
2000 |
SIGMOD |
0.00049150032 |
| 131 |
Integrating Compression and Execution in Column-Oriented Database Systems |
2006 |
SIGMOD |
0.0004370331 |
| 233 |
A Study of Index Structures for Main Memory Database Management Systems |
1986 |
VLDB |
0.00032021526 |
| 241 |
DB2 with BLU Acceleration: So Much More than Just a Column Store |
2013 |
VLDB |
0.00031420034 |
| 1,087 |
HOT: A Height Optimized Trie Index for Main-Memory Database Systems |
2018 |
SIGMOD |
0.00014162909 |
| 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,169 |
SuRF: Practical Range Query Filtering with Fast Succinct Tries |
2018 |
SIGMOD |
0.00013536447 |
| 1,312 |
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes |
2016 |
SIGMOD |
0.00012652548 |
| 2,134 |
How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations |
2006 |
VLDB |
9.4741038e-05 |
| 2,394 |
Building a Bw-Tree Takes More Than Just Buzz Words |
2018 |
SIGMOD |
8.9001843e-05 |
| 2,856 |
Efficient Index Compression in DB2 LUW |
2009 |
VLDB |
8.0056412e-05 |
| 5,532 |
A Padded Encoding Scheme to Accelerate Scans by Leveraging Skew |
2015 |
SIGMOD |
5.4548897e-05 |
| 8,077 |
Hyperion: Building the Largest In-memory Search Tree |
2019 |
SIGMOD |
4.59165e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,660 |
On Searching Compressed String Collections Cache-Obliviously |
2008 |
PODS |
4.4722862e-05 |
| 1,117 |
Cache-Oblivious String B-trees |
2006 |
PODS |
0.00013882205 |
| 8,578 |
Robust and Budget-Constrained Encoding Configurations for In-Memory Database Systems |
2022 |
VLDB |
4.4923477e-05 |
| 1,087 |
HOT: A Height Optimized Trie Index for Main-Memory Database Systems |
2018 |
SIGMOD |
0.00014162909 |
| 8,532 |
Frequency-Hiding Order-Preserving Encryption with Small Client Storage |
2021 |
VLDB |
4.4937074e-05 |
| 8,539 |
Efficient Searchable Encryption Through Compression |
2018 |
VLDB |
4.4937074e-05 |
| 9,404 |
Revisiting B-tree Compression: An Experimental Study |
2024 |
SIGMOD |
4.3441378e-05 |
| 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 |
| 9,498 |
Memory-Efficient Search Trees for Database Management Systems |
2021 |
SIGMOD |
4.3341665e-05 |