Time- and space-optimality in B-trees

DOI10.1145/319540.319565zbMath0454.68064OpenAlexW1980034063MaRDI QIDQ3902505

Lawrence V. Snyder, Arnold L. Rosenberg

Publication date: 1981

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

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

zbMATH Keywords

data basesearchingdata structurespace utilizationnode-visit costfile maintenance

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (6)

\(B\)-trees with lazy parent split ⋮ Modeling B-tree insertion activity ⋮ Space saving generalization of \(B\)-trees with \(2/3\) utilization ⋮ Unsafe operations in B-trees ⋮ On the construction of weighted time-optimal B-trees ⋮ Time- and Space-optimal height-balanced 2-3 brother trees

This page was built for publication: Time- and space-optimality in B-trees