Prefix B -trees
- 1 March 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 2 (1) , 11-26
- https://doi.org/10.1145/320521.320530
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.Keywords
This publication has 3 references indexed in Scilit:
- On the encipherment of search trees and random access filesACM Transactions on Database Systems, 1976
- Indexing design considerationsIBM Systems Journal, 1973
- Organization and maintenance of large ordered indexesActa Informatica, 1972