Main-Memory Index Structures with Fixed-Size Partial Keys
Summary: Introduces pkT-trees and pkB-trees for main-memory OLTP by storing fixed-size partial-keys in internal nodes to reduce cache misses. Shows that a tiny key fragment suffices to avoid most misses, enabling simple node layouts and competitive performance against other main-memory trees across diverse key sizes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Philip Bohannon (AT&T)
- 2. Peter McIlroy (AT&T)
- 3. Rajeev Rastogi (AT&T)
BibTeX Citation
@inproceedings{bohannon_sigmod01,
title = {{Main-Memory Index Structures with Fixed-Size Partial Keys}},
author = {Bohannon, Philip and McIlroy, Peter and Rastogi, Rajeev},
series = {{SIGMOD} '01},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/375663.375681},
url = {https://dl.acm.org/doi/10.1145/375663.375681},
year = {2001}
}
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 278 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD | 0.00022476841 |
| 678 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD | 0.00015061068 |
| 925 | Dictionary-based Order-preserving String Compression for Main Memory Column Stores | 2009 | SIGMOD | 0.00013182044 |
| 4,772 | Improving Database Performance on Simultaneous Multithreading Processors | 2005 | VLDB | 6.5154736e-05 |
| 7,792 | Cache-Oblivious Query Processing | 2007 | CIDR | 5.5431413e-05 |
| 8,765 | Contorting High Dimensional Data for Efficient Main Memory KNN Processing | 2003 | SIGMOD | 5.3766157e-05 |
| 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 5.256602e-05 |
| 9,794 | A Compact B-tree | 2002 | SIGMOD | 5.2187932e-05 |
| 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 5.214913e-05 |
| 10,829 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 5.093636e-05 |
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,605 | Towards Efficient Main-Memory Use For Optimum Tree Index Update | 2008 | VLDB |
| 2 | 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 3 | 12,025 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |
| 4 | 790 | FITing-Tree: A Data-aware Index Structure | 2019 | SIGMOD |
| 5 | 1,978 | Optimizing Multidimensional Index Trees for Main Memory Access | 2001 | SIGMOD |
| 6 | 1,710 | Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems | 2001 | VLDB |
| 7 | 964 | Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes | 2016 | SIGMOD |
| 8 | 545 | Improving Index Performance through Prefetching | 2001 | SIGMOD |
| 9 | 1,110 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB |
| 10 | 219 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB |