Some average performance measures for the B-tree

DOI10.1007/BF00289710zbMath0545.68054OpenAlexW1978071187MaRDI QIDQ797287

William E. Wright

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1007/bf00289710

zbMATH Keywords

indexesfile organizationaverage performance measuresaverage storage utilizationlarge B-treesmultiway trees

Mathematics Subject Classification ID

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

Related Items (2)

A uniform model for the storage utilization of B-tree-like structures ⋮ Space saving generalization of \(B\)-trees with \(2/3\) utilization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space utilization and access path length in B-trees
• Storage utilization in B*-trees with a generalized overflow technique
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• B-trees re-examined

This page was built for publication: Some average performance measures for the B-tree