摘要
在地理信息系统中经常要做k-NN搜索,进行这些查询用到的算法与位置和范围查询的算法不同,需要专门进行研究。介绍了一种分支界限遍历R树算法,并将该算法概括为k-NN算法。文中讨论了两种方法,对R树进行结点内MBR的排序以及剪枝过程,以减少搜索空间中需访问结点的数量,有效地进行k-NN搜索。
A frequently encountered type of query in geographic Information systems is to find the k nearest neighbor objects to a given point in space. Processing such queries requires special search algorithms. This paper introduces an efficient branch-and-bound r-tree traversal algorithm to find the nearest neighbor object to a point, and then generalize it to finding the k nearest neighbors.
出处
《计算机工程与设计》
CSCD
2002年第9期77-80,共4页
Computer Engineering and Design
