Data structures and network algorithms
Data structures and network algorithms
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
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
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
We present a unified framework for exact point-of-interest (POI) queries in dynamic road networks. We show how to extend partition-based shortest-path algorithms to answer queries such as finding the closest restaurant or the best post office to stop on the way home, ranking POIs according to a user-defined cost function. We provide various trade-offs between indexing effort and query time. Our most flexible variant allows the road network to change frequently (to account for traffic or personalized cost functions) and the set of POIs to be specified at query time, and is still fast enough for interactive applications on continental networks.