Minimum boundary-length problem in B∗-trees: A case study

摘要

B-trees are suitable data structures for index terms in a database or in an information retrieval system. B∗-trees optimize the characteristics of B-trees. In this paper we present an algorithm for optimization of the pagination of a B∗-tree with variable-length keyed records. We also present some results obtained in the application of this algorithm, compared with the application of a B-tree with variable-length keys.