By Topic

A New K-NN Query Algorithm Based on the Traversal and Search of the Dynamic Rectangle

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 a widely used algorithm in the spatial database, effectively carrying on K-NN query algorithm has become the focus problem of the spatial database, the traditional query algorithm will adopt the measurement distance and pruning strategy to improve the query performance by using the tree index, it needs to carry on a large amount of distance calculation to exclude the unnecessary queried region when continue to find the next nearest neighbor object, the cost of the time spent on the frequent distance calculation is great in the large amount of data objects, so the query efficiency is dramatically decreased, if adopts the grid index to conduct K-NN query, the query scope is not flexible, there will appear many empty grid cells, resulting in the slow searching speed and the low storage utilization. Based on the analysis and research of the previous K-NN algorithm, a new K-NN query algorithm based on the traversal and search of the dynamic rectangle is proposed in this paper, use the clustering method to cluster the spatial data objects to the horizontal and vertical directions of the queried object, select the appropriate rectangle to carry on dynamic movement and obtain the next query range to be searched, the experiments show that the new algorithm uses the dynamic rectangle to effectively select the search range, it can take full advantage of the dynamic rectangular region by use of the clustering algorithm, the query efficiency can be significantly improved within the large space region.

Published in:

E-Product E-Service and E-Entertainment (ICEEE), 2010 International Conference on

Date of Conference:

7-9 Nov. 2010