Performance of Data-Parallel Spatial Operations (1994)
| Citations: | 17 - 6 self |
BibTeX
@MISC{Hoel94performanceof,
author = {Erik G. Hoel and Hanan Samet},
title = {Performance of Data-Parallel Spatial Operations},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R + -tree spatial data structures is compared. The studied operations are data structure build, polygonization, and spatial join in an application domain consisting of planar line segment data (i.e., Bureau of the Census TIGER/Line files). The algorithms are implemented using the scan model of parallel computation on the hypercube architecture of the Connection Machine. The results of experiments reveal that the bucket PMR quadtree outperforms both the R-tree and R + -tree. This is primarily because the bucket PMR quadtree yields a regular disjoint decomposition of space while the R-tree and R + -tree do not. The regular disjoint decomposition increases the potential for interprocessor communication and parallelism in the bucket PMR quadtree, thereby enabling the execution times to decrease relative to those needed by the R-tree and R + -tree. ...
