一种结合空间聚类算法的R树优化算法

摘要

研究R树特点，考虑了离群点对R树结点构造的影响，结合改进的k-medoids 聚类算法提出了一种新的R树构造算法。与传统R树相比，新算法下构造的R树结点更加紧凑。通过实验证明，该优化算法构造的R树在查询性能方面的改进是明显的。%This paper proposes a new method of constructing R-tree by studying its features, considering the outliers’ influence on constructing R-tree’s nodes and combining with improved k-medoids clustering algorithm. The R-tree based on this method has more compact structure compared with traditional R-tree. The results of the study show that, due to the optimization of structure, the improvement of R-tree in query efficiency is effectively.