Multi-table search for B-tree files

Authors:
David B. Lomet
Affiliations:
IBM T. J. Watson Research Center, Yorktown Heights, N. Y.
Venue:
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Year:
1979

Citing 2
Cited 3

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Prefix B-trees

ACM Transactions on Database Systems (TODS)

Trie Hashing with Controlled Load

IEEE Transactions on Software Engineering
The evolution of effective B-tree: page organization and techniques: a personal account

ACM SIGMOD Record
Digital B-trees

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7

Quantified Score

Hi-index	0.00

Visualization

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 analysis, it is shown that the method results in significant space savings, leading to reduced disk accesses during random searches of a B-tree organized file. The search algorithms are shown to be competitive with the best of previous methods for treating variable length entries.