Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks

Continuous K-Nearest Neighbor (CKNN) query is an important type of spatio-temporal queries. A. CKNN query is to find among all moving objects the K-nearest neighbors (KNNs) of a moving query object at each timestamp. In this paper, we focus oil processing such a CKNN query in road networks, where the criterion for determining the KNNs is the shortest; network distance between objects. We first highlight, the limitations of the existing approaches, and then propose a cost-effective algorithm, namely the Continuous KNN algorithm, to overcome these limitations. Comprehensive experiments are conducted to demonstrate the efficiency of the proposed approach.