ComputingComputer ScienceComputer SystemsData StructuresParallel AlgorithmsParallel ComputingData ParallelismParallel Computing SystemsParallel Data StructuresParallel DatabasesSpatial Data StructuresSpatial Database SystemsIntersectionIntersection QueriesParallel Geometric Data StructuresParallel Join AlgorithmsParallel Spatial DatabasesQuadtreesSpatial Join ProcessingSpatial Query Processing
Efficient data-parallel spatial join algorithms for bucket PMR quadtrees and R-trees, common spatial data structures, are given. The domain consists of planar line segment data (i.e., Bureau of the Census TIGER/Line files). Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the scan model of parallel computation on the hypercube architecture of the Connection Machine.
11
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · ACM SIGMOD Record · 1990 · 1.4K citations
W. Daniel Hillis, Guy L. Steele · Communications of the ACM · 1986 · 891 citations · Full text