A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation
[article]
2016
arXiv
pre-print
A k nearest neighbor (kNN) query on road networks retrieves the k closest points of interest (POIs) by their network distances from a given location. Today, in the era of ubiquitous mobile computing, this is a highly pertinent query. While Euclidean distance has been used as a heuristic to search for the closest POIs by their road network distance, its efficacy has not been thoroughly investigated. The most recent methods have shown significant improvement in query performance. Earlier studies,
arXiv:1601.01549v2
fatcat:kj5llfoomnahnlgm2zsjeb2yzi