基于R-树的连续最近邻查询算法优化研究  

Research of optimal continuous nearest neighbor query algorithm based on R-tree

作　　者：刘彬[1] 万静[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080

出　　处：《信息技术》2008年第1期78-79,82,共3页Information Technology

摘　　要：连续最近邻查询是空间数据库中一类重要的查询,在解决这个问题的已有方法中,最有效的是基于R-树的一次遍历算法,但这个算法中没有对R树的遍历顺序进行优化,没能最大程度地删剪结点,就磁盘存取而言是低效率的。对这个算法进行了改进,通过优化遍历顺序减少了磁盘存取数量,提高了I/O效率。The continuous nearest neighbor query is one of the most important kind of queries in spatial databases. The most efficient one in the existing solutions to this problem is a single traversal algorithm in R-tree. However, the algorithm is not optimal to the order of R-tree traversal and can not prune the entry to the highest degree, so it is low efficient in terms of disk accesses. This paper refines the algorithm which reduces the number of disk accesses and improves the I/O efficiency by optimizing the traversal order.

关 键 词：空间数据库 连续最近邻 R-树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]