DocumentCode
526418
Title
Notice of Retraction
An query processing for continuous K-nearest neighbor based on R-Tree and Quad Tree
Author
Yon-Gui Zou ; Song Qiang ; Fu-Ping Yang
Author_Institution
Sino-Korea Chongqing GIS Res. Center, Chongqing Univ. of Posts & Telecommun., Chongqing, China
Volume
5
fYear
2010
fDate
9-11 July 2010
Firstpage
35
Lastpage
40
Abstract
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.
This paper focus on continuous K-nearest neighbor (CKNN for short) query and propose a query method based on R-Tree and Quad Tree (QR-Tree) to support continuous K-nearest neighbor query for moving objects, in which the main idea is to use a QR-Tree to divide the static spatial space for the moving objects. In the interested region, it uses the QR-Tree and hash tables as an index to store the moving object, and then calculates the distances between the query point and the moving objects to get the result. The comprehensive experimentation shows that the performance of the proposed method is better than existing methods in query efficiency and resource consumption.
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.
This paper focus on continuous K-nearest neighbor (CKNN for short) query and propose a query method based on R-Tree and Quad Tree (QR-Tree) to support continuous K-nearest neighbor query for moving objects, in which the main idea is to use a QR-Tree to divide the static spatial space for the moving objects. In the interested region, it uses the QR-Tree and hash tables as an index to store the moving object, and then calculates the distances between the query point and the moving objects to get the result. The comprehensive experimentation shows that the performance of the proposed method is better than existing methods in query efficiency and resource consumption.
Keywords
file organisation; quadtrees; query processing; CKNN; QR-tree; continuous k-nearest neighbor query; hash tables; moving object; quad tree; query efficiency; query method; query processing; r-tree; resource consumption; static spatial space; Artificial neural networks; ISO; Robustness; CKNN; Moving Objects; QR-Tree; Quad Tree; R-Tree;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-5537-9
Type
conf
DOI
10.1109/ICCSIT.2010.5563984
Filename
5563984
Link To Document