Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries

S Nutanong, R Zhang, E Tanin, L Kulik - The VLDB Journal, 2010 - Springer
The VLDB Journal, 2010Springer
The moving k nearest neighbor (M k NN) query continuously finds the k nearest neighbors of
a moving query point. M k NN queries can be efficiently processed through the use of safe
regions. In general, a safe region is a region within which the query point can move without
changing the query answer. This paper presents an incremental safe-region-based
technique for answering M k NN queries, called the V*-Diagram, as well as analysis and
evaluation of its associated algorithm, V*-k NN. Traditional safe-region approaches compute …
Abstract
The moving k nearest neighbor (MkNN) query continuously finds the k nearest neighbors of a moving query point. MkNN queries can be efficiently processed through the use of safe regions. In general, a safe region is a region within which the query point can move without changing the query answer. This paper presents an incremental safe-region-based technique for answering MkNN queries, called the V*-Diagram, as well as analysis and evaluation of its associated algorithm, V*-kNN. Traditional safe-region approaches compute a safe region based on the data objects but independent of the query location. Our approach exploits the knowledge of the query location and the boundary of the search space in addition to the data objects. As a result, V*-kNN has much smaller I/O and computation costs than existing methods. We further provide cost models to estimate the number of data accesses for V*-kNN and a competitive technique, RIS-kNN. The V*-Diagram and V*-kNN are also applicable to the domain of spatial networks and we present algorithms to construct a spatial-network V*-Diagram. Our experimental results show that V*-kNN significantly outperforms the competitive technique. The results also verify the accuracy of the cost models.
Springer
Showing the best result for this search. See all results