摘要： 为了有效构建R-树，通过分析数据矩形的性质，结合改进的K-均值算法，提出一种用于构建R-树的数据矩形聚类新方法，给出基于R-树和四叉树的空间索引结构以及该空间索引结构的构造算法和节点插入算法。研究结果表明，该索引结构具有更紧凑的结构和更高的空间查询效率。

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

Abstract: In order to construct R-tree effectively, this paper proposes a new method of clustering data rectangles used to construct R-tree by analyzing the characteristics of data rectangles and combining the improved K-means algorithm. A spatial index structure based on R-tree and quadtree is proposed. Constructing algorithm and node inserting algorithm for new index structure are given. Research results show that the structure has more compact structure and higher query efficiency.

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

中图分类号: 

• TP391