Batch insertion for tree structured file organizations—improving differential database representation

摘要

This paper presents an algorithm to perform batch insertions into tree structured files. The efficiency of the algorithm is formally analyzed. To demonstrate the usefulness of the algorithm, optimum batch insertion points are determined in one particular example. The example demonstrates that batch operations for tree structured files may be used to achieve the advantages of a differential database representation and, at the same time, avoid the drawbacks previously attributed to the use of differential files.