An Query Processing for Continuous K-Nearest Neighbor Based on R-Tree and Quad Tree
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 QRTree 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.
R-Tree Quad Tree QR-Tree CKNN Moving Objects
Yong-Gui Zou Qiang Song
Sino-Korea Chongqing GIS Research Center, College of Computer Science and Technology,Chongqing University of Posts and Telecommunications, China
国际会议
重庆
英文
36-41
2010-04-22(万方平台首次上网日期,不代表论文的发表时间)