review Open AccessTop 1% cited
Ubiquitous B-Tree
ACM Computing Surveys · 1979 · Vol. 11(2) · pp. 121–137
Douglas E. Comer✉(Purdue University West Lafayette)
Abstract
B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and nnplemented using B-trees This paper reviews B-trees and shows why they have been so successful It discusses the major variations of the B-tree, especially the B+-tree, contrasting the relatwe merits and costs of each implementatmn. It illustrates a general purpose access method whmh uses a B-tree.
Advanced Data Storage TechnologiesAlgorithms and Data CompressionPeer-to-Peer Network TechnologiesComputer scienceCitationTree (set theory)World Wide Web
Funding
- International Business Machines Corporation
Citations
1,834
FWCI
23.04
field-weighted impact
References
34
Percentile
99%
vs. same field & year
Citations per year
Cited by
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys · 1984 · 2,184 citations
Query evaluation techniques for large databases
ACM Computing Surveys · 1993 · 1,253 citations
Multidimensional access methods
ACM Computing Surveys · 1998 · 1,588 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
