DBScholar

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
4211
Venue
SIGMOD
Year
2009
Pagerank
9.0762376e-05
Overall Rank
2,153 | 85.23%
DOI
10.1145/1559845.1559907

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chen_sigmod09,
        title = {{Monitoring Path Nearest Neighbor in Road Networks}},
        author = {Chen, Zaiben and Shen, Heng Tao and Zhou, Xiaofang and Yu, Jeffrey Xu},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559907},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559907},
        year = {2009}
}

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