Multi-Table Search for B-Tree Files

Abstract

A new method of organizing index entries in nodes of a B-tree is presented. The method is designed specifically to work with variable length keys. Thus it is particularly suited to take advantage of the variable length entries that result when key compression techniques are used. The paper analyses the characteristics of compressed keys. Based on this… (More)
DOI: 10.1145/582095.582101

Topics

3 Figures and Tables

Slides referencing similar topics