Aggregate k-nearest neighbors queries in time-dependent road networks

In this paper we present an algorithm for processing aggregate nearest neighbor queries in time-dependent road networks, i.e., given a road network where the travel time over an edge is time-dependent, a set of query points Q, a set of points of interest (POIs) P and an aggregate function (e.g., sum), we find the k POIs that minimize the aggregated travel time from the query points. For instance, considering a city's road network at a given departure time and a group of friends at different locations wishing to meet at a restaurant, the time-dependent aggregate nearest neighbor query, considering the sum function, would return the restaurant that minimizes the sum of all travel times to it. The main contribution of our work is the consideration of the time-dependency of the network, a realistic characteristic of urban road networks, which has not been considered previously when addressing aggregate nearest neighbor queries. Our approach is based on the ANNQPLB algorithm proposed by Htoo et al. and uses Hub Labels, proposed by Abraham et al., to compute optimistic travel times efficiently. In order to compare our proposal we extended the previously proposed ANNQPLB algorithm aimed at non-time dependent aggregate nearest neighbor queries, enabling it to deal with the time-dependency. Our experiments using a real road network have shown our proposed solution to be up to 94% faster than the temporally extended previous solution.

[1]  Shashi Shekhar,et al.  Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results , 2007, SSTD.

[2]  Farnoush Banaei Kashani,et al.  Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks , 2010, DEXA.

[3]  Kyriakos Mouratidis,et al.  Aggregate nearest neighbor queries in spatial databases , 2005, TODS.

[4]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[5]  Noboru Sonehara,et al.  Aggregate Nearest Neighbor Search Methods Using SSMTA* Algorithm on Road-Network , 2012, ADBIS.

[6]  Weiwei Sun,et al.  Voronoi-based aggregate nearest neighbor query processing in road networks , 2010, GIS '10.

[7]  Andrew V. Goldberg,et al.  Robust Distance Queries on Massive Networks , 2014, ESA.

[8]  Dimitris Papadias,et al.  Aggregate nearest neighbor queries in road networks , 2005, IEEE Transactions on Knowledge and Data Engineering.

[9]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.

[10]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[11]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[12]  Dorothea Wagner,et al.  Speed-Up Techniques for Shortest-Path Computations , 2007, STACS.

[13]  Takahiro Hara,et al.  kNN Search Utilizing Index of the Minimum Road Travel Time in Time-Dependent Road Networks , 2014, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops.

[14]  Leo Liberti,et al.  Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.

[15]  Maytham Safar,et al.  Group K-Nearest Neighbors queries in spatial network databases , 2008, J. Geogr. Syst..

[16]  Farnoush Banaei Kashani,et al.  Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases , 2010, DNIS.

[17]  Noboru Sonehara,et al.  Single-Source Multi-Target A* Algorithm for POI Queries on Road Network , 2011, WAIM Workshops.

[18]  Ran Raz,et al.  Distance labeling in graphs , 2001, SODA '01.

[19]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[20]  Martin Erwig,et al.  The graph Voronoi diagram with applications , 2000, Networks.

[21]  Kyriakos Mouratidis,et al.  Group nearest neighbor queries , 2004, Proceedings. 20th International Conference on Data Engineering.

[22]  Mahdi Abdelguerfi,et al.  Efficient AKNN spatial network queries using the M-Tree , 2007, GIS.

[23]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[24]  Hanxiong Chen,et al.  Efficient Bounds in Finding Aggregate Nearest Neighbors , 2008, DEXA.

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.