Partition Based Spatial-Merge Join (1996)
Cached
Download Links
- [www.eecs.umich.edu]
- [www.eecs.umich.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 150 - 8 self |
BibTeX
@INPROCEEDINGS{Patel96partitionbased,
author = {Jignesh M. Patel and David J. DeWitt},
title = {Partition Based Spatial-Merge Join},
booktitle = {},
year = {1996},
pages = {259--270}
}
Years of Citing Articles
OpenURL
Abstract
This paper describes PBSM (Partition Based Spatial--Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are intermediate results in a complex query, or in a parallel environment where the inputs must be dynamically redistributed. The PBSM algorithm partitions the inputs into manageable chunks, and joins them using a computational geometry based plane--sweeping technique. This paper also presents a performance study comparing the the traditional indexed nested loops join algorithm, a spatial join algorithm based on joining spatial indices, and the PBSM algorithm. These comparisons are based on complete implementations of these algorithms in Paradise, a database system for handling GIS applications. Using real data sets, the performance study examines the behavior of these spatial join algorithms in a vari...







