R-Trees: A Dynamic Index Structure for Spatial Searching.

Guttman, A. (1984). R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, 47-57.

Type

Conference paper

Intellectual base

Primary research

Year

1984

Pages

47-57

DOI

10.1145/602259.602266

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/602259.602266

Cited from

computer_science

Cited by

2 citations across 2 artifacts.

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

Primes

• Index
  • Spatial indexes use space-filling curves or hierarchical bounding, an idea reused in graph partitioning and physics tree codes.

    This sourceSpatial index using hierarchical bounding; the bounding/space-partitioning idea reused in graph partitioning and physics tree codes.

• Spatial Indexing
  • In computer-science data structures, B-trees and hash tables organize items by key in a one-dimensional address space, while R-trees, quadtrees, kd-trees, and grid-files organize multidimensional points for range and nearest-neighbor search, and space-filling curves and geohashes linearize multidimensional space for proximity queries.

    This sourceIntroduces the R-tree for indexing multidimensional objects for range and nearest-neighbor queries — a canonical spatial index.

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? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

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:a44cf0cc7d5f · see in the full table