The Continuous Nearest Neighbor Query on Moving Objects
The Continuous Nearest Neighbor Query (CNN) of the moving object is one of the hot research point in spatio-temporal database. In this paper, using the TPR-Tree indexing mechanism, we can get all candidates of NN object and the distance curve for the query object, and then we can get the NN object set for one time. In this way, it can reduce the time of querying and spatio-temporal computing. In the same time, this paper adds the concept of time interval in the query process. Using the distance function computing the distance between the query point and moving objects and than getting the time splitting points, we can change the nearest neighbors of the query point and feedback the query results to the user dynamically, so that it can achieve the purpose of continuous query.
Moving Object Continuous Neares NeighborQuery TPR-Tree
Ying Xia Xian-Li Zou Yan Li Hae-Young Bae
Sino-Korea Chongqing GIS Research Center, College of Computer Science and Technology,Chongqing Unive Dept. of Computer Science and Information Engineering, Inha University, Korea
国际会议
重庆
英文
33-35
2010-04-22(万方平台首次上网日期,不代表论文的发表时间)