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.
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 indexes use space-filling curves or hierarchical bounding, an 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.
- 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.
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:a44cf0cc7d5f · see in the full table