-
- Rudolf Bayer
- Technische Univ. München, Munich, West Germany
-
- Karl Unterauer
- Technische Univ. München, Munich, West Germany
書誌事項
- 公開日
- 1977-03
- 権利情報
-
- https://www.acm.org/publications/policies/copyright_policy#Background
- DOI
-
- 10.1145/320521.320530
- 公開者
- Association for Computing Machinery (ACM)
この論文をさがす
説明
<jats:p> Two modifications of <jats:italic>B</jats:italic> -trees are described, simple prefix <jats:italic>B</jats:italic> -trees and prefix <jats:italic>B</jats:italic> -trees. Both store only parts of keys, namely prefixes, in the index part of a <jats:italic>B</jats:italic> <jats:sup>*</jats:sup> -tree. In simple prefix <jats:italic>B</jats:italic> -trees those prefixes are selected carefully to minimize their length. In prefix <jats:italic>B</jats:italic> -trees the prefixes need not be fully stored, but are reconstructed as the tree is searched. Prefix <jats:italic>B</jats:italic> -trees are designed to combine some of the advantages of <jats:italic>B</jats:italic> -trees, digital search trees, and key compression techniques while reducing the processing overhead of compression techniques. </jats:p>
収録刊行物
-
- ACM Transactions on Database Systems
-
ACM Transactions on Database Systems 2 (1), 11-26, 1977-03
Association for Computing Machinery (ACM)