随着空间信息网格的建设,网格平台上管理的空间信息资源越来越丰富,这促进了空间信息网格中空间数据分布式查询的应用需求,而在分布式空间查询中,空间连接查询操作往往成为性能的瓶颈.根据空间信息的特点,通过利用网格计算资源来优化空间连接查询的执行.首先基于网格服务构建网格平台分布式空间数据查询软件结构,通过设计远程空间连接执行服务利用网格平台中的计算资源;根据空间信息的特点.采用基于Kd-Tree空间分区并行连接的方法提高远程空间数据连接操作执行效率,并给出了远程空间连接执行的查询代价模型;然后根据连接代价模型设计了远程空间连接查询执行计划优化生成算法;最后总结了本文工作并探讨了下一步研究方向.

With the application of the Spatial Information Grid (SIG),the spatial information managed by SIG being more andmore abundant. The abundantspatial information reguires the betterapplication ofdistributed spatial information query acrossSIG. However, the remote spatial join queries are always the bottleneck in the distributed spatial information query. Based on this observation, in this paper,the spatial join queries are optmi ized by taking full advantage of the grid computing resources according to the characteristics of spatial information.At first, the software architecture for distributed spatial query is designed based on the different grid services. The distributed spatial data query software architecture is composed of three different kinds of grid services, namely:Distributed SpatialDataQuery Grid Service (DSDQGS), SpatialData Grid Service (SDGS) and Remote Spatial Join Query Grid Service (RSJQGS), These three kinds ofgrid services cooperate to mi plement the optmi ization and execution of the distributed spatial data query.In the architecture,the grid computing resources are utilized by the remote spatial join queries execution grid services.Secondly, the partitioned parallel spatial join queries are mi plemented by theKd-Tree spatial partition scheme. In the scheme, an original spatial query is rewrite into several sub-spatial queries bounded by sub regions of the Kd-Tree nodes, which can be run concurrently; therefore, the performance of the remote spatial join queries is mi proved. The cost model for the partitioned parallel spatial join queries is also presented in paper.The costof the remote spatial join query involves two parts: the computing costof the join operation and communication costof the spatial data.Thirdly, the optmi ization algorithm for the query planed to generate the remote spatial join queries is designed according to the costmode.l The remote spatial join query plan prescribes the way the spatial join query execution,including the scheme forpartitioned parallel spatial join query, SDGSs participated in the join query, and assignments of\nthe partitioned parallel spatial join query tasks to RSJQGSs. The cost isbenchmark for the remote spatial join query plan.The parameters utilized in the optmi ization algorithm are managed as properties of the WSRF. The full optmi ization algorithm is finishedwhen all identified spatial join operators are processed.At last, the future research directions for the optmi ization of spatial distributed query on SIG are discussed.