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.
引用
收藏
页码:279 / 280
页数:2
相关论文
共 3 条
[1]
[Anonymous], 1972, ACTA INFORM, DOI [10.1007/BF00288683, DOI 10.1007/BF00288683]