Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.82
The remote spatial join queries are always the performance bottleneck in the distributed spatial information query. In the paper, the spatial join queries are optimized by taking advantage of the grid computing resources according to the characteristics of spatial information. At first, the software architecture for distributed spatial query is designed as the different kinds of grid services, and in the architecture, the grid computing resources are utilized by the remote spatial join query grid services; Secondly, the partitioned parallel spatial join queries are implemented by the Kd-Tree based spatial partition method, in the way, a spatial join query task is separated into several sub-spatial join queries, which can run in parallel to improve the query performance, and the cost model for the partitioned parallel spatial join queries is also presented; Thirdly, the optimization algorithm for the query plan generation and some implementation details are brief descript; At last, the paper is summarized and the future research directions are discussed.
Spatial Information Grid, Distributed Spatial Query Optimization, Parallel Query
C. Xie, G. Liu, W. Sheng and B. Gao, "The Optimization of Remote Spatial Join Queries on Spatial Information Grid," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 356-359.