By Topic

An Efficient Technique for Continuous K-Nearest Neighbor Query Processing on Moving Objects in a Road Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guohui Li ; Sch. of Comput. Sci. & Technol., Hua Zhong Univ. of Sci. & Technol., Wuhan, China ; Ping Fan ; YanHong Li ; Jianqiang Du

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.

Published in:

Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on

Date of Conference:

June 29 2010-July 1 2010