By Topic

OQ-Quad: An efficient query processing for continuous k-nearest neighbor based on quad tree

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

2 Author(s)
Yong-Gui Zou ; Sino-Korea Chongqing GIS Research Center, College of Computer Science, Chongqing University of Posts &Telecom., China ; Qing-Lin Fan

With the growing popularity of mobile computing and wireless communications, managing the continuously changing information of the moving objects is becoming feasible, especially in LBS application which is characterized by a large number of moving objects and a large number of continuous queries. In this paper, we focus on continuous k-nearest neighbor (CkNN for short) query and propose a query method based on a quad tree to support continuous k-nearest neighbor query for moving objects, in which the main idea is to use a quad tree to divide the static spatial space for the moving objects. In the interested region, we use the quad tree and hash tables as an index to store the moving objects. Then we calculate the distances between the query point and the moving objects from inside to outside to get the result. Our comprehensive experimentation shows that the performance of the proposed method is better in memory consumption and processing time than the CMP algorithm.

Published in:

Computer Science & Education, 2009. ICCSE '09. 4th International Conference on

Date of Conference:

25-28 July 2009