Prefix B-Trees

  title={Prefix B-Trees},
  author={Rudolf Bayer and Karl Unterauer},
  journal={ACM Trans. Database Syst.},
Two modifications of <italic>B</italic>-trees are described, simple prefix <italic>B</italic>-trees and prefix <italic>B</italic>-trees. Both store only parts of keys, namely prefixes, in the index part of a <italic>B</italic><supscrpt>*</supscrpt>-tree. In simple prefix <italic>B</italic>-trees those prefixes are selected carefully to minimize their length. In prefix <italic>B</italic>-trees the prefixes need not be fully stored, but are reconstructed as the tree is searched. Prefix <italic>B… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 176 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 99 extracted citations

Transaction Processing

Data-Centric Systems and Applications • 2014
View 5 Excerpts
Highly Influenced

Modularizing B+-trees: Three-Level B+-trees Work Fine

ADMS@VLDB • 2013
View 12 Excerpts
Highly Influenced

Foster b-trees

ACM Trans. Database Syst. • 2012
View 5 Excerpts
Highly Influenced

B-tries for disk-based string management

The VLDB Journal • 2008
View 6 Excerpts
Highly Influenced

Two Access Methods Using Compact Binary Trees

IEEE Transactions on Software Engineering • 1987
View 4 Excerpts
Highly Influenced

177 Citations

Citations per Year
Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…