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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Chung, W., Park, S. Y., & Bae, H. Y. (2005). Efficient parallel spatial join processing method in a shared-nothing database cluster system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3605 LNCS, pp. 81–87). Springer Verlag. https://doi.org/10.1007/11535409_11
Mendeley helps you to discover research relevant for your work.