Find in Library

This paper is a description and analysis of of one the data structure types called a B-tree. B-trees are balanced multi-branch tree structures which make it possible to maintain large files with a guaranteed efficiency. A proposed algorithm are presented here to help us to measure the behavior (such as the tree utilization and the leaf node utilization) of this type of data structure.