The Ubiquitous B-Tree.

Comer, D. (1979). The Ubiquitous B-Tree. ACM Computing Surveys, 11(2), 121-137.

Type

Journal article

Intellectual base

Primary research

Year

1979

Volume

11

Issue

2

Pages

121-137

DOI

10.1145/356770.356776

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/356770.356776

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Index
  • In computer science it is database indexes (B-tree, hash, bitmap, inverted), inverted indexes in information retrieval, spatial indexes, inode tables, and compiler symbol tables.

    This sourceSurvey of the B-tree as the canonical key-to-location index: an auxiliary balanced structure giving O(log n) lookup on its indexed key at O(log n) maintenance per write, serving range queries that hashing cannot.

    Supported in partVerified against the work's full text

    Comer supports B-trees as the standard index structure for files and database systems, but not the other listed index types.

    “File indexes of users, dedicated database systems, and general-purpose access methods have all been proposed and nnplemented using B-trees”

    Read by an automated reader; not a human review. How support was checked

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:37aa495185f8 · see in the full table