Time- and space-optimality in B-trees

DOI10.1145/319540.319565MaRDI QIDQ3902505zbMATH OpenOpenAlexFDO

Authors Arnold L. Rosenberg, Lawrence V. Snyder

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 basedata structurefile maintenancenode-visit costsearchingspace utilization

Mathematics Subject Classification ID

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

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902505)