Data-Parallel Spatial Join Algorithms

E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bureau of the Census TIGER Line les. Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the SAM Scan-AndMonotonic-mapping model of parallel computation on the hypercube architecture of the Connection Machine.

• Type: Conference
• Year: 1994
• Where: ICPP
• Authors: Erik G. Hoel, Hanan Samet
• Keywords: Distributed And Parallel Computing, ICPP 1994, Spatial Data Structures, Spatial Join Algorithms, Spatial Range Query