Data-Parallel R-Tree Algorithms

Authors:
Erik G. Hoel;Hanan Samet
Affiliations:
Bureau of the Census, USA;University of Maryland, USA
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
Year:
1993

Citing 0
Cited 1

Performance of Data-Parallel Spatial Operations

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

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 files). 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-And-Monotonic-mapping) model of parallel computation on the hypercube architecture of the Connection Machine.