By Topic

A new K-NN query algorithm based on the dynamic movement of spatial objects

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

2 Author(s)
Guobin Li ; Sch. of Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China ; Jine Tang

The K-NN query algorithm is an important class of query algorithm in spatial database, the traditional K-NN query algorithm used the measurement distance and pruning strategy to search in the adopted index tree, the regional division algorithm based on the grid obtained the nearest neighbor objects by calculating the distance between the queried object and the data objects within the eight grids around the queried object, and carried on expanding inquiry scope outward layer by layer, in view of the advantage of the grid index, a new K-NN query algorithm based on the dynamic movement of spatial objects is proposed in this paper, it only carries on grid division to a small part of region around the queried object, when all the data objects in the current grid are already searched, make the cells in the grid empty, dynamically move the external data objects into the grid area continue to query according to the relative position of these objects, because the algorithm uses a fixed grid area to query the data objects in the whole region, so it can reduce the target storage space and the complexity degree of the algorithm calculation, the experiments show that the new query algorithm is superior to the traditional algorithms in the querying performance when the amount of data is increased, and the query efficiency is greatly increased.

Published in:

Educational and Information Technology (ICEIT), 2010 International Conference on  (Volume:1 )

Date of Conference:

17-19 Sept. 2010