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)
Incoming Non-self Citations Over Time
Authors
- 1. Huanchen Zhang (Carnegie Mellon University)
- 2. Xiaoxuan Liu (Carnegie Mellon University)
- 3. David G. Andersen (Carnegie Mellon University)
- 4. Michael Kaminsky (BrdgAI)
- 5. Kimberly Keeton (Hewlett Packard Enterprise)
- 6. Andrew Pavlo (Carnegie Mellon University)
BibTeX Citation
@inproceedings{zhang_sigmod20,
title = {{Order-Preserving Key Compression for In-Memory Search Trees}},
author = {Zhang, Huanchen and Liu, Xiaoxuan and Andersen, David G. and Kaminsky, Michael and Keeton, Kimberly and Pavlo, Andrew},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3380583},
url = {https://dl.acm.org/doi/10.1145/3318464.3380583},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,951 | On Searching Compressed String Collections Cache-Obliviously | 2008 | PODS |
| 2 | 1,112 | Cache-Oblivious String B-trees | 2006 | PODS |
| 3 | 8,410 | Robust and Budget-Constrained Encoding Configurations for In-Memory Database Systems | 2022 | VLDB |
| 4 | 882 | HOT: A Height Optimized Trie Index for Main-Memory Database Systems | 2018 | SIGMOD |
| 5 | 7,723 | Frequency-Hiding Order-Preserving Encryption with Small Client Storage | 2021 | VLDB |
| 6 | 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 7 | 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD |
| 8 | 921 | Query Optimization In Compressed Database Systems | 2001 | SIGMOD |
| 9 | 925 | Dictionary-based Order-preserving String Compression for Main Memory Column Stores | 2009 | SIGMOD |
| 10 | 9,635 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD |