Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Finding Fastest Paths on A Road Network with Speed Patterns
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
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
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Towards modeling the traffic data on road networks
Proceedings of the Second International Workshop on Computational Transportation Science
Spatio-temporal network databases and routing algorithms: a summary of results
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
The islands approach to nearest neighbor querying in spatial networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Towards k-nearest neighbor search in time-dependent spatial network databases
DNIS'10 Proceedings of the 6th international conference on Databases in Networked Information Systems
Efficient evaluation of k-NN queries using spatial mashups
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Range query processing in multi-objective networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
SMashQ: spatial mashup framework for k-NN queries in time-dependent road networks
Distributed and Parallel Databases
A review of urban computing for mobile phone traces: current methods, challenges and opportunities
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
A group based approach for path queries in road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Nearest neighbor queries with service time constraints in time-dependent road networks
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
| Hi-index | 0.00 |
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 time-dependent and vary significantly in short durations, hence invalidating the existing solutions. In this paper, we study the problem of kNN search in time-dependent 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.