DBScholar

Back to papers

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)

Paper ID
3328
Venue
SIGMOD
Year
2001
Pagerank
9.6941032e-05
Overall Rank
1,813 | 87.57%
DOI
10.1145/375663.375681

Incoming Non-self Citations Over Time

Authors

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.

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