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
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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
Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Towards modeling the traffic data on road networks
Proceedings of the Second International Workshop on Computational Transportation Science
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
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
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
Easiest-to-reach neighbor search
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient k-nearest neighbor search in time-dependent spatial networks
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Efficient evaluation of k-NN queries using spatial mashups
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
SMashQ: spatial mashup framework for k-NN queries in time-dependent road networks
Distributed and Parallel 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
Secured obfuscated queries in spatial networks
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
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.