Storage utilization in B*-trees with a generalized overflow technique

zbMath0501.68005MaRDI QIDQ1172382

Klaus Kuespert

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (2)

\(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: Storage utilization in B*-trees with a generalized overflow technique