Short Note: Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files
F. Warren Burton · The Computer Journal · 1990
The aim of this study is to present an algorithm which manipulates overlapping B-trees. The characteristic of the algorithm is that it uses a number of pointer manipulation routines which may replace pointer manipulations within an ordinary B-tree without sharing. The main advantages of the approach are (a) that any code operating on ordinary B-tree may be easily extended to cope with overlapping B-tree, and (b) that the pointer manipulation routines are general purpose in the sense that they may be applied to a broader family of tree structures