© 1990 by British Computer Society
Short Note
Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files


1 School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6, 2 Department of Electrical Engineering, Division of Computer Science, National Technical University of Athens, 15 773 Zografou, Athens, Greece, 3 Laboratory of Soils and Agricultural Chemistry, Athens Faculty of Agriculture, 11855 Botanikos, Athens, Greece
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.
Received June 1988.
* School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6. Dr. Burton's work was supported by the Natural Science and Engineering Research Council of Canada
Department of Electrical Engineering, Division of Computer Science, National Technical University of Athens, 15 773 Zografou, Athens, Greece
¶ Laboratory of Soils and Agricultural Chemistry, Athens Faculty of Agriculture, 11855 Botanikos, Athens, Greece