J4 ›› 2013, Vol. 35 ›› Issue (1): 149-154.
• 论文 • 上一篇 下一篇
许凯,杨萌
收稿日期:
修回日期:
出版日期:
发布日期:
XU Kai,YANG Meng
Received:
Revised:
Online:
Published:
摘要:
传统的反向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
许凯,杨萌. 移动对象的反向k近邻查询算法的研究[J]. J4, 2013, 35(1): 149-154.
XU Kai,YANG Meng. Algorithm research on continuous reverseknearestneighbor query for spatial moving objects[J]. J4, 2013, 35(1): 149-154.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2013/V35/I1/149