• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (1): 149-154.

• 论文 • 上一篇    下一篇

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

许凯,杨萌   

  1. (河海大学计算机与信息学院,江苏 南京 210098;南京工业大学,江苏 南京 210009)
  • 收稿日期:2011-11-08 修回日期:2012-02-20 出版日期:2013-01-25 发布日期:2013-01-25

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

XU Kai,YANG Meng   

  1. (Department of Computer and Information Engineering,Hohai University,Nanjing 210098;
    Nanjing University of Technology,Nanjing 210009,China)
  • Received:2011-11-08 Revised:2012-02-20 Online:2013-01-25 Published:2013-01-25

摘要:

传统的反向k近邻查询的研究主要集中在k=1时的单色移动对象的反向最近邻查询上,单色和双色的反向k近邻查询问题还没有解决。利用网格索引结构结合60°平面修剪策略,提出了一种解决单色和双色的移动对象的连续反向k近邻查询方法。最后实验结果验证了算法的有效性。

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

Abstract:

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.

Key words: reverse nearest neighbor;continuous nearest neighbor;grid index;range query