摘要
针对传统的R-树节点交叠面积大的问题,提出了一种新的空间数据索引结构——R0-树.主要思想是在内部树结点存储外部对象,如果将这样的对象存储在树的更高层,则低层结点的最小边界矩形MBR的面积更小,因此索引的性能更好.研究结果表明,此方法能可提高空间利用率,减少I/O访问次数,使索引性能得到大幅提升.
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 R^0-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.
出处
《哈尔滨理工大学学报》
CAS
北大核心
2009年第4期9-11,16,共4页
Journal of Harbin University of Science and Technology
