Monitoring path nearest neighbor in road networks

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 follow the shortest path, the query path keeps changing. The challenge of monitoring the k-PNN for an arbitrarily moving user is to dynamically determine the update locations and then refresh the k-PNN efficiently. We propose a three-phase Best-first Network Expansion (BNE) algorithm for monitoring the kPNN and the corresponding shortest path. In the searching phase, the BNE finds the shortest path to the destination, during which a candidate set that guarantees to include the k-PNN is genera...

• Type: Conference
• Year: 2009
• Where: SIGMOD
• Authors: Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey Xu Yu
• Keywords: Corresponding Shortest Path, Database, Query Path, Shortest Path, SIGMOD 2009