Shortest path and distance queries on road networks: An experimental evaluation

Proceedings of the VLDB Endowment

Volumn 5, Issue 5, 2012, Pages 406-417

  Wu, Lingkun ^a   Xiao, Xiaokui ^a   Deng, Dingxiong ^b   Cong, Gao ^a   Zhu, Andy Diwen ^a   Zhou, Shuigeng ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MOTOR TRANSPORTATION; ROADS AND STREETS; TRANSPORTATION;

COMPREHENSIVE COMPARISONS; EXPERIMENTAL EVALUATION; PREPROCESSING TIME; REAL ROAD NETWORKS; SHORTEST PATH QUERIES; SPACE CONSUMPTION; SPATIAL COHERENCE; STATE-OF-THE-ART TECHNIQUES;

GRAPH THEORY;

EID: 84863772459     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2140436.2140438     Document Type: Article

References (26)

1. http://algo2.iti.kit.edu/english/routeplanning.php.
2. https://sourceforge.net/projects/ntu-sp-exp/.
3. http://www.dis.uniroma1.it/~challenge9/.
4. I. Abraham, A. Fiat, A. V. Goldberg, and R. F. F. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In SODA, pages 782-793, 2010.
5. H. Bast, S. Funke, and D. Matijevic. Transit: ultrafast shortest-path queries with linear-time preprocessing. In Proc. of the 9th DIMACS Implementation Challenge, pages 175-192, 2006. http://www.mpi-inf.mpg.de/~dmatijev/papers/DIMACS06.pdf.
6. H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes. In transit to constant time shortest-path queries in road networks. In ALENEX, 2007.
7. H. Bast, S. Funke, P. Sanders, and D. Schultes. Fast routing in road networks with transit nodes. Science, 316(5824):566, 2007.
8. D. Delling, P. Sanders, D. Schultes, and D. Wagner. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks, pages 117-139, 2009.
9. E. W. Dijkstra. A note on two problems in connection with graphs. Numerical Mathematics, 1:269-271, 1959.
10. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci., 72(5):868-889, 2006.
11. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In WEA, pages 319-333, 2008.
12. *search meets graph theory. In SODA, pages 156-165, 2005.
13. *: Efficient point-to-point shortest path algorithms. In ALENEX, pages 129-143, 2006.
14. S. Gupta, S. Kopparty, and C. V. Ravishankar. Roads, codes and spatiotemporal queries. In PODS, pages 115-124, 2004.
15. M. Hilger, E. K̈ohler, R. H. M̈ohring, and H. Schilling. Fast point-to-point shortest path computations with arc-flags. In Proc. of the 9th DIMACS Implementation Challenge, pages 73-92, 2006.
16. N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. TKDE, 10(3):409-432, 1998.
17. S. Jung and S. Pramanik. An efficient path computation model for hierarchically structured topographical road maps. TKDE, 14(5):1029-1046, 2002.
18. P. N. Klein, S. Mozes, and O. Weimann. Shortest paths in directed planar graphs with negative lengths: A linear-space o(nlog2n)-time algorithm. ACM Transactions on Algorithms, 6(2), 2010.
19. I. Pohl. Bi-directional search. Machine Intelligence, 6:127-140, 1971.
20. M. Rice and V. J. Tsotras. Graph indexing of road networks for shortest pth queries with label restrictions. PVLDB, 4:69-80, 2010.
21. H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD, pages 43-54, 2008.
22. P. Sanders and D. Schultes. Highway hierarchies hasten exact shortest path queries. In ESA, pages 568-579, 2005.
23. J. Sankaranarayanan, H. Alborzi, and H. Samet. Efficient query processing on spatial networks. In GIS, pages 200-209, 2005.
24. J. Sankaranarayanan and H. Samet. Query processing using distance oracles for spatial networks. IEEE Trans. Knowl. Data Eng., 22(8):1158-1175, 2010.
25. J. Sankaranarayanan, H. Samet, and H. Alborzi. Path oracles for spatial networks. PVLDB, 2:1210-1221, 2009.
26. D. Schultes. Route Planning in Road Networks. PhD thesis, University Karlsruhe (TH), 2008.