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
The log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
Robinson, J. T. (1981) · Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81 · doi:10.1145/582318.582321 · Cited by 888
Böhm, C., Berchtold, S., & Keim, D. A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502809 · Cited by 827
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
The adaptive radix tree: ARTful indexing for main-memory databases
Leis, V., Kemper, A., & Neumann, T. (2013) · 2013 IEEE 29th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544812 · Cited by 420
Dynamic authenticated index structures for outsourced databases
Li, F., Hadjieleftheriou, M., Kollios, G., & Reyzin, L. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142488 · Cited by 415
ASSERT: A Physician-in-the-Loop Content-Based Retrieval System for HRCT Image Databases
Shyu, C.-R., Brodley, C. E., Kak, A. C., Kosaka, A., Aisen, A. M., & Broderick, L. S. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0768 · Cited by 387
Multi-dimensional range queries in sensor networks
Li, X., Kim, Y. J., Govindan, R., & Hong, W. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958500 · Cited by 387
Consistent and durable data structures for non-volatile byte-addressable memory
Venkataraman, S., Tolia, N. H., Ranganathan, P., & Campbell, R. H. (2011) · doi:10.5555/1960475.1960480 · Cited by 356
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Sun, W., Wang, B., Cao, N., Li, M., Lou, W., Hou, Y. T., & Li, H. (2013) · Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security · doi:10.1145/2484313.2484322 · Cited by 338
Cache-conscious structure layout
Chilimbi, T. M., Hill, M. D., & Larus, J. R. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301633 · Cited by 334
A review of moving object trajectory clustering algorithms
Yuan, G., Sun, P., Zhao, J., Li, D., & Wang, C. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9477-7 · Cited by 323
The string B-tree: a new data structure for string search in external memory and its applications
Ferragina, P., & Grossi, R. (1999) · Journal of the ACM · doi:10.1145/301970.301973 · Cited by 317
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Kim, C., Chhugani, J., Satish, N., Sedlar, E., Nguyen, A. D., Kaldewey, T., Lee, V. W., Brandt, S. A., & Dubey, P. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807206 · Cited by 306
Information retrieval and text mining technologies for chemistry
Krallinger, M., Rabal, O., Lourenço, A., Oyarzabal, J., & Valencia, A. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00851 · Cited by 281
Range queries in OLAP data cubes
Ho, C.-T., Agrawal, R., Megiddo, N., & Srikant, R. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253274 · Cited by 281
A history and evaluation of System R
Chamberlin, D. D., Astrahan, M. M., Blasgen, M. W., Gray, J. N., King, W. F., Lindsay, B. G., Lorie, R., Mehl, J. W., Price, T. G., Putzolu, F., et al. (1981) · Communications of the ACM · doi:10.1145/358769.358784 · Cited by 273
Doust, J. (2009) · BMJ · doi:10.1136/bmj.b3823 · Cited by 41
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.