Hilbert R-tree Spatial Index Algorithm Based on Clustering

【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.