Clone join and shadow join: two parallel spatial join algorithms

  • Authors:

  • Jignesh M. Patel;David J. DeWitt

  • Affiliations:

  • EECS Department, University of Michigan, Ann Arbor, MI;Computer Sciences Department, University of Wisconsin, Madison, Wl

  • Venue:
  • Proceedings of the 8th ACM international symposium on Advances in geographic information systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spatial applications frequently need to join two data sets based on some spatial relationship between objects in the two data sets. This operation, called a spatial join, is an expensive operation and in the past many algorithms have been proposed for evaluating the spatial join operation on a single processor system. However, the use of parallelism for handling queries involving large volumes of spatial data has received little attention. In this paper, we explore the use of parallelism for evaluating the spatial join operation. We first propose two strategies for storing spatial data in a parallel database system. We propose a number of spatial join algorithms based on these declustering strategies. Two algorithms are identified as the key algorithms in this design space. We analyze these two algorithms both analytically and experimentally. The experimental evaluation uses real data sets and is based on an actual implementation in a parallel database system. The experiments show that both algorithms can effectively exploit parallelism.