Efficient parallel spatial join processing method in a shared-nothing database cluster system

Authors:
Warnill Chung;Soon-Young Park;Hae-Young Bae
Affiliations:
Electronics and Telecommunications Research Institute, Daejeon, Korea;Dept. of Computer Science & Information Engineering, INHA University, Inchon, Korea;Dept. of Computer Science & Information Engineering, INHA University, Inchon, Korea
Venue:
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
Year:
2004

Citing 3
Cited 0

Partition based spatial-merge join

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Parallel Processing of Spatial Joins Using R-trees

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Parallel R-Tree Spatial Join for a Shared-Nothing Architecture

DANTE '99 Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments

Quantified Score

Hi-index	0.03

Visualization

Abstract

Spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is raised. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. Therefore, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of spatial data. Since proposed method does not need the creation step and the assignment step of tasks, and additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries.