Spatial Index Structure Based on R-tree
Xiaoshuang Gao · Jisuanji gongcheng · 2009
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.