高度动态环境下移动对象连续K近邻查询算法

计算机科学 ›› 2011, Vol. 38 ›› Issue (3): 182-186.

高度动态环境下移动对象连续K近邻查询算法

牛剑光，陈荦，赵亮，谭洁

(国防科技大学电子科学与工程学院　长沙410073)

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家863项目(2007AA12Z208)资助。

Processing Continuous K Nearest Neighbor Queries on Highly Dynamic Moving Objects

NIU Jian-guang,CHEN Luo,ZHAO Liang,TAN Jie

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 针对面向高度动态移动对象集的多用户连续K近部查询，提出了基于查询索引的多用户连续K近邻查询处理(Query Index based Multiple Continuous K-Nearest Neighbor Queries, QI-MCKNN)算法，阐述了查询索引的概念和构建方法，分析了格网大小对查询性能的影响，给出了相应的查询处理算法。实验表明，算法在面对高度动态的移动对象集时，查询处理性能优于基于移动对象格网索引的SEA-CNN算法。

关键词: 高度动态，连续K近邻查询，格网索引，QI-MCKNN算法

Abstract: To evaluate multiple continuous k nearest neighbor queries on highly dynamic moving objects, we proposed an algorithm for processing Query Index based Multiple Continuous K-Nearest Neighbor Qucrics(QI-MCKNN)，discussed the conception of Query Index and the solution to construct the grid index, analyzed the effect of grid size on query processing,and provided the corresponding procedure. Finally experimental results verify that when dealing with highly dynamic moving objects,the proposed algorithm is much more effective than the traditional SEA-CNN algorithm which is based on the objects index

Key words: Highly dynamic, Continuous k nearest neighbors queries, Grid index, QI-MCKNN algrithm

牛剑光，陈荦，赵亮，谭洁. 高度动态环境下移动对象连续K近邻查询算法[J]. 计算机科学, 2011, 38(3): 182-186. https://doi.org/

NIU Jian-guang,CHEN Luo,ZHAO Liang,TAN Jie. Processing Continuous K Nearest Neighbor Queries on Highly Dynamic Moving Objects[J]. Computer Science, 2011, 38(3): 182-186. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed