Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/prefix-b-trees-f64N5H2uqs
References (9)
-
R. Bayer, J. Metzger, München Germany (1975)
On the encipherment of search trees and random access files, 10
-
D. Knuth (1973)
The art of computer programming: sorting and searching (volume 3) -
R. Bayer (1974)
Storage Characteristics and Methods for Searching and Addressing -
(1976)
Received June -
D. Knuth (1968)
The Art of Computer Programming -
R. Bayer, J. Metzger (1976)
On the encipherment of search trees and random access filesACM Trans. Database Syst., 1
-
H. Wedekind (1974)
On the Selection of Access Paths in a Data Base System -
R. Wagner (1973)
Indexing Design ConsiderationsIBM Syst. J., 12
-
(1976)
Schltisselkompressionen in B*-biiumen
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1977 by ACM Inc.
- ISSN
- 0362-5915
- DOI
- 10.1145/320521.320530
- Publisher site
- See Article on Publisher Site
Abstract
Two modifications of B -trees are described, simple prefix B -trees and prefix B -trees. Both store only parts of keys, namely prefixes, in the index part of a B * -tree. In simple prefix B -trees those prefixes are selected carefully to minimize their length. In prefix B -trees the prefixes need not be fully stored, but are reconstructed as the tree is searched. Prefix B -trees are designed to combine some of the advantages of B -trees, digital search trees, and key compression techniques while reducing the processing overhead of compression techniques.
Journal
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Mar 1, 1977