计算机工程 ›› 2009, Vol. 35 ›› Issue (9): 40-42.doi: 10.3969/j.issn.1000-3428.2009.09.014

• 软件技术与数据库 • 上一篇    下一篇

基于聚类的Hilbert R-树空间索引算法

何小苑1,闵华清2   

  1. (1. 广东水利电力职业技术学院计算机信息工程系,广州 510635;2. 华南理工大学软件学院,广州 510006)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-05-05 发布日期:2009-05-05

Hilbert R-tree Spatial Index Algorithm Based on Clustering

HE Xiao-yuan1, MIN Hua-qing2   

  1. (1. Department of Computer Information Engineering, Guangdong Technical College of Water Resources and Electric Engineering, Guangzhou 510635; 2. School of Software, South China University of Technology, Guangzhou 510006)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-05-05 Published:2009-05-05

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

关键词: 空间索引, 聚类, Hilbert R-树

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.

Key words: spatial index, clustering, Hilbert R-tree

中图分类号: