Sciweavers

38
Voted
EDBT
2006
ACM

Fast Nearest Neighbor Search on Road Networks

14 years 10 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes closer than the NN to the query must be visited. The latter, e.g., the Voronoi Network Nearest Neighbor (V N3 ) approach, can handle sparse datasets but is inappropriate for medium and dense datasets due to its high precomputation and storage overhead. In this paper, we propose a new approach that indexes the network topology based on a novel network reduction technique. It simplifies the network by replacing the graph topology with a set of interconnected tree-based structures called SPIE's. An nd index is developed for each SPIE and our new (k)NN search algorithms on an SPIE follow a predetermined tree path to avoid costly network expansion. By mathematical analysis and experimental results, our ...
Haibo Hu, Dik Lun Lee, Jianliang Xu
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2006
Where EDBT
Authors Haibo Hu, Dik Lun Lee, Jianliang Xu
Comments (0)