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

摘要

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