Sciweavers

Share
ICDE
2009
IEEE

V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries

10 years 5 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region concept called the V*-Diagram. By incrementally maintaining the V*-Diagram, V*-kNN continuously provides accurate MkNN query results and supports dynamically changing values of k. Our approach exploits information regarding the current location of the query point and the search space in addition to the data objects. As a result, the V*-kNN has much smaller IO and computation costs than existing methods.
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul
Added 20 Oct 2009
Updated 20 Oct 2009
Type Conference
Year 2009
Where ICDE
Authors Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kulik
Comments (0)
books