A New Spatial Index Structure

Aiming at the problem of the area of overlap in traditional R-tree' nodes is too big,propose a kind of new spatial data index structure named R0-tree is proposed.The main idea is to store outlier objects in internal tree nodes.If such objects are stored at higher levels of the tree,the lower level nodes have smaller minim-um bounding rectangles and thus the index performs better.The experiment results show that this method can be able to raise the rate of space utilization,reducing the I/O accessing times,making the performance of index promote significantly.