Data-Parallel R-Tree Algorithms

13 years 6 months ago
Data-Parallel R-Tree Algorithms
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les. Parallel algorithms for both building the data-parallel R-tree, as well as determining the closed polygons formed by the line segments, are described and implemented using the SAM Scan-AndMonotonic-mapping model of parallel computation on the hypercube architecture of the Connection Machine.
Erik G. Hoel, Hanan Samet
Added 08 Aug 2010
Updated 08 Aug 2010
Type Conference
Year 1993
Where ICPP
Authors Erik G. Hoel, Hanan Samet
Comments (0)