Binary trees paging

摘要

A dynamic page allocation technique for binary search trees is proposed. The method is based on page splitting, like the B-tree construction procedure, and on balanced bunch allocation into the pages. An analysis of the paged index structure resulting from the proposed allocation technique is performed. Furthermore the resulting index can be considered as a modification of B-trees in order to give a flexible structure to the keys in a page. A comparison with B-trees is then carried on, pointing out the field of application of the proposed approach.