Space utilization and access path length in B-trees

Abstract 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.