Space utilization and access path length in B-trees
作者:
Highlights:
•
摘要
B-trees are useful for the maintenance of very large indexes. In this paper a deterministic model for the computation of space utilization and access path length in B-trees is presented. The considerations include a general form of B-trees that provides underflow and overflow treatment. Results for utilization and path length for some typical B-tree situations are given.
论文关键词:
论文评审过程:Received 22 December 1978, Revised 12 June 1979, Available online 10 June 2003.
论文官网地址:https://doi.org/10.1016/0306-4379(80)90064-2