Database Paper Browser

Back to papers

Monitoring Path Nearest Neighbor in Road Networks

Summary: Defines k-Path Nearest Neighbor (k-PNN) for a moving user: k candidates tied to the shortest path between current location and destination. Proposes Best-first Network Expansion (BNE), a three-phase (search/verify/monitor) method with an expansion tree to efficiently update shortest paths and k-PNN as routes move. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4149
Venue
SIGMOD
Year
2009
Pagerank
0.00011512916
Overall Rank
1,526 | 89.39%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers