Parallel Spatial Join Scheme for Efficient Query Processing in a Shared-Nothing Database Cluster
Spatial database cluster consisted of several single nodes on highspeed 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.
Warnill Chung Soon-Young Park Hae-Young Bae
Electronics and Telecommunications Research Institute,161 Gajeong-dong, Yuseong-gu, Daejeon, 305-350 Dept.of Computer Science & Information Engineering, INHA University,253 YongHyun-3Dong, Nam-Gu, Inch
国际会议
首届嵌入式软件与系统国际会议(Proceedings of the First International Conference on Embedded Software and System)
杭州
英文
31-36
2004-12-09（万方平台首次上网日期，不代表论文的发表时间）