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

DOI

10.1145/356770.356776

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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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