【摘要】 R-树适合于动态索引,但空间重叠大,而Hilbert R-树也不能有效降低节点覆盖和交叠,直接影响R-树的查询效率。为适应大量的GIS查询应用需要,提出对Hilbert R-树节点进行聚类的索引算法,较好地解决相邻数据的聚类存放,使叶节点MBR面积减小,内部节点交叠降低,并对该算法进行实验测试和性能分析,结果表明该算法具有较高的查询效率。更多还原

【Abstract】 Considering that R-tree is suitable for the dynamic index,its spatial overlap between nodes is great,and Hilbert R-tree cannot reduce the coverage and overlap effectively,which influences directly R-tree querying efficiency.In order to meet the demands of many GIS querying applications,the Hilbert R-tree index algorithm based on the nodes clustering is proposed.The algorithm resolves preferably the clustering storage for the adjacent data,decreasing the leaf nodes MBR area and the spatial overlap between interior nodes.Experiments conducted and performances are analyzed for the algorithm.The results show that the algorithm has high efficiency in querying.更多还原