HilCluster:a Simple and Efficient Algorithm for R-Tree Packing
Zhang Chi-wei · Computer Technology and Development · 2007
Traditional Hilbert Packed R-Tree packs the spatial objects by the turn of their Hilbert values.Though the algorithm is simple and rapid,the spatial objects which neighboring in their spatial location do not necessarily neighboring in their Hilbert values.Because of this,its query efficiency decline for the data distributed unevenly.The algorithm clustering recursively resolved the problem,but it has high construction expense,and the R-Tree constructed by means of it usually is imbalance,which result in low space utilization and efficiency.In this paper,united above two methods,proposed a new bulk-loading algorithm for the R-Tree called HilCluster.The experimental data indicates that the new algorithm not only inherit Hilbert Packed R-Tree's low construction expense and high space utilization percent,but also has better performance in searching.