【摘要】 为消除空间信息孤岛,研究开放网格服务架构,建立空间信息共享平台。用户通过平台中的网格服务透明访问虚拟组织中的数据。为提升数据索引服务的性能,提出一种改进的R树算法,在节点分裂时考虑其他节点是否有剩余空间,从而避免了频繁的分裂导致产生大量的节点。实验结果表明,与经典R-树节点分裂算法相比,改进后的节点分裂算法的空间查询性能得到提升,该研究可为空间信息全面共享提供实用可行的实施方案。更多还原

【Abstract】 In order to eliminate the spatial information silo,this paper set up the spatial data sharing platform through the research of open grid services architecture.Clients could get access to the data in the virtual organization by the platform’s grid services.In order to improve the performance of index service,it proposed a new R-tree’s algorithm.During the process of splitting one node,it checked other’s nodes to provide appropriate accommodation for the new node.As a result,frequently splitting could be avoided and the number of nodes decreased.The experiment results show that the improved algorithm can increase the spatial searching speed.The research can be used to guide the all-sided implementation of spatial data sharing.更多还原