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

Open Access

1 January 1990

journal article
Published by Oxford University Press (OUP) in The Computer Journal

Vol. 33 (3) , 279-280
https://doi.org/10.1093/comjnl/33.3.279

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.

Keywords

ALGORITHM
OVERLAPPING B TREES
LEADS
FILES
NEED TO REPRESENT
SIMILAR CONTENT
MANIPULATION
REPRESENT A COLLECTION

This publication has 0 references indexed in Scilit: