Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases

The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a generalized form of this problem, called the Time-Dependent k Nearest Neighbor problem (TD-kNN) with which edge-weights are time variable. All existing approaches for kNN search assume that the weight (e.g., travel-time) of each edge of the spatial network is constant. However, in real-world edge-weights are time-dependent (i.e., the arrival-time to an edge determines the actual travel-time on that edge) and vary significantly in short durations. We study the applicability of two baseline solutions for TD-kNN and compare their efficiency via extensive experimental evaluations with real-world data-sets, including a variety of large spatial networks with real traffic-data recordings.

[1]  Kyriakos Mouratidis,et al.  Continuous nearest neighbor monitoring in road networks , 2006, VLDB.

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

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

[4]  Chin-Wan Chung,et al.  An Efficient and Scalable Approach to CNN Queries in a Road Network , 2005, VLDB.

[5]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[6]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[7]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[8]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

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

[10]  Jeffrey Xu Yu,et al.  Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.

[11]  Farnoush Banaei Kashani,et al.  Towards modeling the traffic data on road networks , 2009, IWCTS '09.

[12]  Dorothea Wagner,et al.  Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs , 2003, ESA.

[13]  Hua Lu,et al.  S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks , 2007, SSTD.

[14]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[15]  Chengyang Zhang,et al.  Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.

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

[17]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[18]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

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

[20]  Brian C. Dean,et al.  Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies , 2004, Networks.

[21]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

[22]  Farnoush Banaei Kashani,et al.  Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction , 2009, SSTD.

[23]  Christian S. Jensen,et al.  The Islands Approach to Nearest Neighbor Querying in Spatial Networks , 2005, SSTD.