The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Ubiquitous B-Tree
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Algorithms+Data Structures = Programs
(2024) · Data Structures and Algorithms in Java · doi:10.1017/9781009260350.002 · Cited by 953
A dichromatic framework for balanced trees
Guibas, L. J., & Sedgewick, R. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.3 · Cited by 661
Symmetric binary B-Trees: Data structure and maintenance algorithms
Bayer, R. (1972) · Acta Informatica · doi:10.1007/bf00289509 · Cited by 495
The multics system: an examination of its structure
(1972) · Cited by 386
A new representation for linear lists
Guibas, L. J., McCreight, E. M., Plass, M. F., & Roberts, J. R. (1977) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800105.803395 · Cited by 164
B-trees in a system with multiple users
Samadi, B. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90005-3 · Cited by 83
Held, G., & Stonebraker, M. R. (1978) · Communications of the ACM · doi:10.1145/359340.359348 · Cited by 32
Cited by
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Bigtable: A Distributed Storage System for Structured Data
Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1365815.1365816 · Cited by 3,460
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
Bigtable: a distributed storage system for structured data
Chang, F. W., Dean, J. B., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2006) · doi:10.5555/1298455.1298475 · Cited by 1,928
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,612
Metadata
- Authors
- Comer, D.
- Venue
- ACM Computing Surveys
- Published
- 1979-06
- Volume
- 11
- Issue
- 2
- Pages
- 121-137
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2161694911
- Cited by
- 1,859
- References
- 9
- FWCI
- 17.64
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.