Space utilization and access path length in B-trees

DOI10.1016/0306-4379(80)90064-2zbMath0432.68045OpenAlexW2093972161MaRDI QIDQ1138915

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

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

Related Items (6)

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

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