Efficient shortest path finding of k-nearest neighbor objects in road network databases

Authors:
Sung-Hyun Shin;Sang-Chul Lee;Sang-Wook Kim;Junghoon Lee;Eul Gyu Im
Affiliations:
Hanyang University, Korea;Hanyang University, Korea;Hanyang University, Korea;Jeju National University, Korea;Hanyang University, Korea
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 9
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate indexing in road network databases

Proceedings of the 2009 ACM symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses an efficient path finding scheme that complements classic k-NN (Nearest Neighbor) queries for the road network. Aiming at finding both k objects and the shortest paths to them at the same time, this paper first selects candidate objects by the k-NN search scheme based on the underlying index structure and then finds the path to each of them by the modified A* algorithm. The path finding step stores the intermediary paths from the query point to all of the scanned nodes and then attempts to match the common segment with a path to a new node, instead of repeatedly running the A* algorithm for all k points. Additionally, the cost to the each object calculated in this step makes it possible to finalize the k objects from the candidate set as well as to order them by the path cost. Judging from the result, the proposed scheme can eliminate redundant node scans and provide one of the most fundamental building blocks for location-based services in the real-life road network.