A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

Blog Article

K nearest neighbor (kNN) search is an important problem in location-based services (LBS) and has been well studied on static road networks.However, in real world, road networks are often time-dependent; i.e.

, the time for traveling through a road always changes over time.Most existing methods for kNN query build various indexes maintaining the shortest distances for some pairs of vertices on static road networks.Unfortunately, these methods Panini Grills / Sandwich Presses cannot be used for the time-dependent road networks because the shortest distances always change over time.

To address the problem of kNN query on time-dependent road networks, we propose a novel voronoi-based index in this paper.Furthermore, we propose a novel balanced tree, named V-tree, which is a secondary level index on voronoi-based index to make our querying algorithm more efficient.Moreover, we propose an algorithm for preprocessing time-dependent Weight Management road networks such that the waiting time is not necessary to be considered.

We confirm the efficiency of our method through experiments on real-life datasets.