A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Monitoring path nearest neighbor in road networks
2009
Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new query returns the k -NN with respect to the shortest path connecting the destination and the user's current location, and thus provides a list of nearest candidates for reference by considering the whole coming journey. We name this query the k -Path Nearest Neighbor query (k -PNN). As the user is moving and may not always
doi:10.1145/1559845.1559907
dblp:conf/sigmod/ChenSZY09
fatcat:467fil4ovzb3vn45tdxgncogre