No abstract

No abstract

No abstract

Recently more and more people focus on continuous K-Nearest Neighbor (CKNN) query processing over moving Objects in Road Networks. A CKNN query is to find among all moving objects the K-nearest neighbors (KNNs) of a moving query object during a period of time. The main issue with existing methods is that moving objects change their locations frequently over time and if their location updates cannot be processed in time, the system runs the risk of retrieving the incorrect results of KNN. In this paper, an effective method is proposed to deal with continuous K-Nearest Neighbor query processing. By considering whether a moving object o is moving farther away from or getting closer to a query point q, the object which is definitely not in the KNN result set is effectively excluded. Thus we can reduce the communication cost, meanwhile we can also simplify the network distance computation between moving objects and query q. Comprehensive experiments are conducted and the results verify the effectiveness of the proposed algorithms.

No abstract