Data-Parallel Spatial Join Algorithms

1994 International Conference on Parallel Processing Vol. 3 Pub Date : 1994-08-15 DOI:10.1109/ICPP.1994.82

E. Hoel, H. Samet

引用次数: 44

Abstract

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.

查看原文本刊更多论文

数据并行空间连接算法

给出了桶型PMR四叉树和r -树两种常用空间数据结构的高效数据并行空间连接算法。该域由平面线段数据(即人口普查局TIGER/ line文件)组成。描述了地图交点和空间距离查询的并行算法。算法在连接机的超立方体架构上采用并行计算的扫描模型实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1994 International Conference on Parallel Processing Vol. 3

自引率

0.00%

发文量