By Topic

CkNN monitoring based on parallel pre-computing

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
$31 $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)
Jing Yuan ; Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China ; Guang-Zhong Sun ; Zhong Zhang ; Nenghai Yu

The problem of k nearest neighbor (kNN) queries plays an important role in spatial information retrieval. The continuous k nearest neighbor query is a variation of kNN query which is aimed to find the kNN in a given path for a query point continuously. Recently, The problem of CkNN queries over moving objects in road networks has caught more and more researchers' attention due to its various applications. In this paper, we report on a pre-processing based approach to answer CkNN queries with light online computation cost. We evaluate our approach on a real data set. The evaluation results validate the effectiveness and efficiency of our approach. Besides, we design a prototype system for monitoring and navigating the urban taxis based on CkNN queries. In our system, we utilize the parallel pre-computing and approximation techniques to support a large number of moving objets. Through a web-based graphical interface, both taxi drivers and pedestrians can access our system and query for their CkNN.

Published in:

Geoinformatics, 2010 18th International Conference on

Date of Conference:

18-20 June 2010