B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys

DOI10.1145/2907945zbMath1474.68063OpenAlexW2499700696MaRDI QIDQ5012564

Roozbeh Ebrahimi, Bradley C. Kuszmaul, Haodong Hu, Michael A. Bender

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2907945

zbMATH Keywords

dynamic programmingatomic keysB-tree with different-sized keyscache-oblivious B-tree with different-sized keys

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

This page was built for publication: B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys