| 空间信息网格中远程空间连接查询的优化 |
| |
| 引用本文： | 谢传节,刘高焕,高秉博,盛文涛.空间信息网格中远程空间连接查询的优化[J].遥感学报,2008,12(5). |
| |
| 作者姓名： | 谢传节 刘高焕 高秉博 盛文涛 |
| |
| 作者单位： | 中国科学院,地理科学与资源研究所,资源与环境信息系统国家重点试验室,北京,100101 |
| |
| 基金项目： | 国家高技术研究发展计划项目
，
中国科学院创新研究领域前沿项目资金的支持
|
| |
| 摘 要： | 随着空间信息网格的建设,网格平台上管理的空间信息资源越来越丰富,这促进了空间信息网格中空间数据分布式查询的应用需求,而在分布式空间查询中,空间连接查询操作往往成为性能的瓶颈.根据空间信息的特点,通过利用网格计算资源来优化空间连接查询的执行.首先基于网格服务构建网格平台分布式空间数据查询软件结构,通过设计远程空间连接执行服务利用网格平台中的计算资源;根据空间信息的特点.采用基于Kd-Tree空间分区并行连接的方法提高远程空间数据连接操作执行效率,并给出了远程空间连接执行的查询代价模型;然后根据连接代价模型设计了远程空间连接查询执行计划优化生成算法;最后总结了本文工作并探讨了下一步研究方向.
|
| 关 键 词： | 空间信息网格 分布式空间查询优化 远程空间连接查询 并行查询 |
The Optimization of Remote Spatial Join Queries on Spatial Information Grid |
| |
| XIE Chuan-jie,LIU Gao-huan,GAO Bing-bo and SHENGWen-tao.The Optimization of Remote Spatial Join Queries on Spatial Information Grid[J].Journal of Remote Sensing,2008,12(5). |
| |
| Authors: | XIE Chuan-jie LIU Gao-huan GAO Bing-bo and SHENGWen-tao |
| |
| Abstract: | 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
QueryGrid 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
the partitioned parallel spatial join query tasks toRSJQGSs. 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. |
| |
| Keywords: | spatial information grid remote spatial join queries distributed spatial query optmi ization parallel query |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《遥感学报》浏览原始摘要信息 |
| 点击此处可从《遥感学报》下载免费的PDF全文 |
|
