On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?

Rolf Fagerberg David Hammer Ulrich Meyer

Published in: ISAAC (2019)

Keyphrases

b tree
expected cost
binary search trees
disk accesses
optimal solution
concurrency control
data structure
index structure
main memory
arbitrary length
secondary storage
replacement policy
minimum cost
r tree
total cost
indexing techniques
shape model
main memory databases
multi dimensional
machine learning