Space utilization and access path length in B-trees

DOI10.1016/0306-4379(80)90064-2MaRDI QIDQ1138915zbMATH OpenOpenAlexFDO

Authors Konrad H. Quitzow, Manfred R. Klopprogge

Publication date 1980

Published in Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0306-4379(80)90064-2

zbMATH Keywords

balanced treescomputation of space utilization and access path length in B-trees

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(6)

• B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
• Modeling B-tree insertion activity
• Expected behaviour of \(B^+\)-trees under random insertions
• A uniform model for the storage utilization of B-tree-like structures
• Modeling splits in file structures
• Some average performance measures for the B-tree

This page was built for publication: Space utilization and access path length in B-trees

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