The ubiquitous B-tree (1979)
Cached
Download Links
- [www.cl.cam.ac.uk]
- [www.ssrc.ucsc.edu]
- [www.minet.uni-jena.de]
- [www.cs.wisc.edu]
- [www.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
by
Douglas Comer
| Venue: | ACM Computing Surveys |
| Citations: | 556 - 0 self |
BibTeX
@ARTICLE{Comer79theubiquitous,
author = {Douglas Comer},
title = {The ubiquitous B-tree},
journal = {ACM Computing Surveys},
year = {1979},
volume = {11},
pages = {121--137}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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,
