Short Note: Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files

Abstract

The need to represent a collection of files having similar content in an efficient way leads to the concept of overlapping B-trees. An algorithm for the manipulation of overlapping B-trees is presented.