Cart (Loading....) | Create Account
Close category search window
 

A new K-NN query algorithm based on the symmetric virtual grid and dynamic circle

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 ; Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China ; Jine Tang

The effective implementation of the spatial K-NN query is a particularly concerned problem in geographic information system. In the previous K-NN query algorithms, the tree index will use measurement distance and pruning strategies to reduce the required search space, the grid index will divide the space region into the grid cells with a certain size, search the neighbor region of the queried object through the location relationship among the grid cells, based on the previous K-NN algorithm study, a new K-NN query algorithm based on the symmetric virtual grid and dynamic circle is proposed in this paper, the algorithm will mainly union the data objects whose grid cells are symmetrical with the grid cell which the queried object is in and the queried object, and form multiple virtual grids, query in accordance with the order form inside to outside. In the searching process, use the queried object as the center, the largest K-NN distance in the virtual grid as the radius to make the dynamic circle so as to find the data objects to be searched first in the next virtual grid, the experiments show that the improved K-NN query algorithm can accurately and effectively find the neighbor objects meeting the conditions, and has a wide range of applications in practice.

Published in:

Artificial Intelligence and Education (ICAIE), 2010 International Conference on

Date of Conference:

29-30 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.