移动对象的反向k近邻查询算法的研究  

Algorithm research on continuous reverse-k-nearest-neighbor query for spatial moving objects

作　　者：许凯[1] 杨萌[2] 

机构地区：[1]河海大学计算机与信息学院,江苏南京210098 [2]南京工业大学,江苏南京210009

出　　处：《计算机工程与科学》2013年第1期149-154,共6页Computer Engineering & Science

摘　　要：传统的反向k近邻查询的研究主要集中在k=1时的单色移动对象的反向最近邻查询上,单色和双色的反向k近邻查询问题还没有解决。利用网格索引结构结合60°平面修剪策略,提出了一种解决单色和双色的移动对象的连续反向k近邻查询方法。最后实验结果验证了算法的有效性。There have been no proposals for answering monochromatic and bichromatic RkNN queries problems for continuously moving objects, while the traditional algorithms focus on monochromatic RkNN query for moving objects. This paper proposes an algorithm using the grid index combined with 60° pruning strategy to realize monochromatic and bichromatic RkNN queries for continuously moving objects. Experimental results demonstrate the effectiveness of the proposed algorithm.

关 键 词：反向最近邻 连续最近邻 网格索引 范围查询 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]