The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 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
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th 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
Proximity queries in large traffic networks
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
The geometry of graphs and some of its algorithmic applications
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Generalizing the optimality of multi-step k-nearest neighbor query processing
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
PAROS: pareto optimal route selection
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A case for time-dependent shortest path computation in spatial networks
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
In many GIS applications like location-based services proximity queries in traffic networks usually relate to the time two individuals need to reach each other instead of their "real" geographical distance. In graphs modelling street networks, the travel time needed for a path between two nodes is seldom constant, but rather depends on the traffic conditions and therefore on the time of day. In order to speed up common proximity queries in such a graph with time-dependent edge cost we use an intermediate filter step and propose two variants of a Lipschitz embedding to deal with time dependency and its effects on path finding. While the first one is a simple modification of a static embedding, the second is fully aware of the graphs's time component. Finally, both variants will be evaluated and compared to each other as well as to a simpler baseline.