B-trees re-examined

Authors:
Gerald Held;Michael Stonebraker
Affiliations:
Tandem Computers Inc., Capertino, CA;Univ. of California, Berkeley, CA
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 15

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

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The UNIX time-sharing system

Communications of the ACM

Modeling the storage architectures of commercial database systems

ACM Transactions on Database Systems (TODS)
Algorithms for Multidimensional Partitioning of Static Files

IEEE Transactions on Software Engineering
A compendium of key search references

ACM SIGIR Forum
Fully persistent B+-trees

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A simple balanced search tree

CSC '93 Proceedings of the 1993 ACM conference on Computer science
Retrospection on a database system

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Technical correspondence: Interlude on signals and semephores revisited

Communications of the ACM
Technical corespondence: Thoughtless programming? author's response

Communications of the ACM
Technical correspondence: on LRU stack model suitability. author's response

Communications of the ACM
B+ trees and indexed sequential files: a performance comparison

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Partial Indexing for Nonuniform Data Distributions in Relational DBMS's

IEEE Transactions on Knowledge and Data Engineering
Efficient Search of Multi-Dimensional B-Trees

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An index organization for applications with highly skewed access patterns

ICSE '81 Proceedings of the 5th international conference on Software engineering
Modern B-Tree Techniques

Foundations and Trends in Databases

Quantified Score

Hi-index	48.28

Visualization

Abstract

The B-tree and its variants have, with increasing frequency, been proposed as a basic storage structure for multiuser database applications. Here, three potential problems which must be dealt with in such a structure that do not arise in more traditional static directory structures are indicated. One problem is a possible performance penalty.