Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks

The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that the weight (e.g., travel-time) of each edge in the spatial network is constant. However, in real-world, edge-weights are timedependent and vary significantly in short durations, hence invalidating the existing solutions. In this paper, we study the problem of kNN search in timedependent spatial networks where the weight of each edge is a function of time. We propose two novel indexing schemes, namely Tight Network Index (TNI) and Loose Network Index (LNI) to minimize the number of candidate nearest neighbor objects and, hence, reduce the invocation of the expensive fastest-path computation in time-dependent spatial networks. We demonstrate the efficiency of our proposed solution via experimental evaluations with real-world data-sets, including a variety of large spatial networks with real traffic-data.

• Type: Conference
• Year: 2010
• Where: DEXA
• Authors: Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Shahabi
• Keywords: Database, DEXA 2010, KNN Search, Spatial Networks, Timedependent Spatial Networks