HOT: A Height Optimized Trie Index for Main-Memory Database Systems
Summary: Height Optimized Trie (HOT) - in-memory index with per-node dynamic bit-width to maximize fanout and cache locality. Compact node layout and SIMD-accelerated search deliver superior string-key performance and smaller memory footprint vs. state-of-the-art indexes, with competitive integer-key results; a general-purpose main-memory index for DBs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Robert Binna (University of Innsbruck)
- 2. Eva Zangerle (University of Innsbruck)
- 3. Martin Pichl (University of Innsbruck)
- 4. Günther Specht (University of Innsbruck)
- 5. Viktor Leis (Technical University of Munich)
BibTeX Citation
@inproceedings{binna_sigmod18,
title = {{HOT: A Height Optimized Trie Index for Main-Memory Database Systems}},
author = {Binna, Robert and Zangerle, Eva and Pichl, Martin and Specht, Günther and Leis, Viktor},
series = {{SIGMOD} '18},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3183713.3196896},
url = {https://dl.acm.org/doi/10.1145/3183713.3196896},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 38 of 38 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 69 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00037950385 |
| 80 | H-Store: A High-Performance, Distributed Main Memory Transaction Processing System | 2008 | VLDB | 0.00036364464 |
| 282 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD | 0.00022264207 |
| 287 | Implementing Database Operations Using SIMD Instructions | 2002 | SIGMOD | 0.00021970198 |
| 542 | FOEDUS: OLTP Engine for a Thousand Cores and NVRAM | 2015 | SIGMOD | 0.0001665543 |
| 548 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00016569534 |
| 891 | SuRF: Practical Range Query Filtering with Fast Succinct Tries | 2018 | SIGMOD | 0.00013245926 |
| 971 | Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes | 2016 | SIGMOD | 0.00012766019 |
| 1,320 | Building a Bw-Tree Takes More Than Just Buzz Words | 2018 | SIGMOD | 0.00011045319 |
| 3,301 | To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing | 2015 | VLDB | 7.4436949e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,955 | The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space | 2012 | PODS |
| 2 | 8,222 | The HV-tree: a Memory Hierarchy Aware Version Index | 2010 | VLDB |
| 3 | 7,154 | Adaptive Hybrid Indexes | 2022 | SIGMOD |
| 4 | 4,721 | Hist-Tree: Those Who Ignore It Are Doomed to Learn | 2021 | CIDR |
| 5 | 971 | Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes | 2016 | SIGMOD |
| 6 | 8,174 | Hyperion: Building the Largest In-memory Search Tree | 2019 | SIGMOD |
| 7 | 7,372 | LITS: An Optimized Learned Index for Strings | 2024 | VLDB |
| 8 | 5,397 | Order-Preserving Key Compression for In-Memory Search Trees | 2020 | SIGMOD |
| 9 | 1,841 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |
| 10 | 229 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB |