Hyperion: Building the Largest In-memory Search Tree
Summary: Hyperion, a trie-based in-memory key-value store, builds the largest in-memory search tree with extreme space efficiency via linear scans instead of vector-unit tricks. A custom allocator yields high density, delivering competitive point queries and exceptional range queries while shrinking the index footprint and achieving over 2x memory-to-performance on randomized strings. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Markus Mäsker
- 2. Tim Süß
- 3. Lars Nagel
- 4. Lingfang Zeng
- 5. André Brinkmann
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,847 | Order-Preserving Key Compression for In-Memory Search Trees | 2020 | SIGMOD | 5.3040014e-05 |
| 5,857 | Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage | 2024 | SIGMOD | 5.2970837e-05 |
| 8,100 | Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction | 2024 | SIGMOD | 4.5821762e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 104 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00049475932 |
| 240 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00031526134 |
| 382 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD | 0.00024888997 |
| 1,085 | HOT: A Height Optimized Trie Index for Main-Memory Database Systems | 2018 | SIGMOD | 0.00014173956 |
| 1,300 | Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes | 2016 | SIGMOD | 0.00012711153 |
Previous
Page 1 / 1
Next