Notice of RetractionA new K-nearest neighbor query algorithm based on grid hierarchical division

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The grid index is an important class of indexing technique in the spatial database. Grid index is widely used in the K - nearest neighbor algorithm, the algorithm proposed in this paper is based on the grid index, find the data objects intersecting with the given circle area or contained in the given circle area and cluster the grids which these data objects are in, the remaining grids will be used as a whole to wait the next cluster, when carry on K-nearest neighbor query every time, it only needs to first query the clustered grids, so it can avoid the complex distance calculation between the queried object and the eight grids around the queried object. Experiments show that the time spent on finding the K-nearest neighbor objects is greatly reduced when the selected circle radius is appropriate, the search efficiency of the algorithm is also significantly increased.