CircularTrip: An Effective Algorithm for Continuous kNN Queries 摘要粗译

循环三元组:关于持续kNN查询的一个有效的算法

Abstract. Continuously monitoring kNN queries in a highly dynamic environment has become a necessity to many recent location-based applications. In this paper, we study the problem of continuous kNN query on the dataset with an in-memory grid index. We first present a novel data access method – CircularTrip. Then, an efficient CircularTrip-based
continuous kNN algorithm is developed. Compared with the existing algorithms, our algorithm is both space and time efficient.

摘要:在高动态变化环境中的持续观测kNN查询方面的技术,最近在一些关于定位的应用中变得很必要.本文中,我们研究了在内存网格索引中的数据集上的持续kNN查询问题.首先我们提出了一个新的数据取取方式-循环三元组,然后,开发了一个有效的基于循环三元组的持续kNN算法.和现存的算法比较,我们的算法无论在空间还是时间上,都是很有效的.