Article

SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

Authors:

Alexandros Efentakis,

Yannis VassiliouAuthors Info & Claims

Proceedings of the 14th International Symposium on Experimental Algorithms - Volume 9125

Pages 298 - 311

https://doi.org/10.1007/978-3-319-20086-6_23

Published: 29 June 2015 Publication History

Abstract

Although recent scientific literature focuses on multiple shortest-path SP problem definitions for road networks, none of the existing solutions can efficiently answer all the different SP query variations. This work proposes SALT, a novel framework that not only efficiently answers most SP queries but also k-nearest neighbor queries not tackled by previous methods. Our solution offers excellent query performance and very short preprocessing times, thus making it also a viable option for dynamic, live-traffic road networks and all types of practical use-cases. The proposed SALT framework is a deployable software solution capturing a range of graph-related query problems under one "algorithmic hood".

References

[1]

Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route Planning in Transportation Networks. Technical report, Microsoft Research 2014

[2]

Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. J. Exp. Algorithmics 15, 2.3:2.1---2.3:2.31 2010

Digital Library

[3]

Delling, D., Goldberg, A., Pajor, T., Werneck, R.: Customizable route planning in road networks. working paper, submitted for publication 2013

[4]

Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. eds. SEA 2011. LNCS, vol. 6630, pp. 376---387. Springer, Heidelberg 2011

Digital Library

[5]

Delling, D., Goldberg, A.V., Werneck, R.F.F.: Faster batched shortest paths in road networks. In: ATMOS, pp. 52---63 2011

[6]

Delling, D., Werneck, R.F.: Faster customization of road networks. In: Demetrescu, C., Marchetti-Spaccamela, A., Bonifaci, V. eds. SEA 2013. LNCS, vol. 7933, pp. 30---42. Springer, Heidelberg 2013

[7]

Delling, D., Werneck, R.F.: Customizable point-of-interest queries in road networks. IEEE Transactions on Knowledge and Data Engineering 2014 to appear

[8]

Demetrescu, C., Goldberg, A.V., Johnson, D.: The shortest path problem. Ninth DIMACS implementation challenge, Piscataway, NJ, USA, November 13---14, 2006. Proceedings. DIMACS Book 74. AMS 2009

[9]

Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. In: Gudmundsson, J., Katajainen, J. eds. SEA 2014. LNCS, vol. 8504, pp. 271---282. Springer, Heidelberg 2014

Digital Library

[10]

Efentakis, A., Pfoser, D.: Optimizing landmark-based routing and preprocessing. In: Proceedings of the 6th ACM SIGSPATIAL International Workshop on Computational Transportation Science. IWCTS 2013, New York, NY, USA, pp. 25---30 2013

Digital Library

[11]

Efentakis, A., Pfoser, D.: GRASP. Extending graph separators for the single-source shortest-path problem. In: Schulz, A.S., Wagner, D. eds. ESA 2014. LNCS, vol. 8737, pp. 358---370. Springer, Heidelberg 2014

[12]

Efentakis, A., Theodorakis, D., Pfoser, D.: Crowdsourcing computing resources for shortest-path computation. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2012. ACM 2012

Digital Library

[13]

Goldberg, A.V., Harrelson, C.: Computing the shortest path: a* search meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156---165 2004

Digital Library

[14]

Jensen, C.S., Kolářvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems, GIS 2003, pp. 1---8. ACM, New York 2003

Digital Library

[15]

Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359---392 1998

Digital Library

[16]

Maue, J., Sanders, P., Matijevic, D.: Goal directed shortest path queries using precomputed cluster distances. In: Àlvarez, C., Serna, M. eds. WEA 2006. LNCS, vol. 4007, pp. 316---328. Springer, Heidelberg 2006

Digital Library

[17]

Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32Nd International Conference on Very Large Data Bases, VLDB 2006, pp. 43---54. VLDB Endowment 2006

Digital Library

[18]

Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, pp. 867---876. ACM, New York 2009

Digital Library

[19]

Sanders, P., Schulz, C.: Engineering multilevel graph partitioning algorithms. In: Demetrescu, C., Halldórsson, M.M. eds. ESA 2011. LNCS, vol. 6942, pp. 469---480. Springer, Heidelberg 2011

Digital Library

[20]

Wang, H., Zimmermann, R.: Processing of continuous location-based range queries on moving objects in road networks. IEEE Transactions on Knowledge and Data Engineering 237, 1065---1078 2011

Digital Library

[21]

Zhong, R., Li, G., Tan, K.-L., Zhou, L.: G-tree: an efficient index for knn search on road networks. In: Proceedings of the 22nd ACM International Conference on Information Knowledge Management, CIKM 2013, pp. 39---48. ACM, New York 2013

Digital Library

Cited By

Buchhold VSanders PWagner D(2019)Real-time Traffic Assignment Using Engineered Customizable Contraction HierarchiesACM Journal of Experimental Algorithmics10.1145/336269324(1-28)Online publication date: 10-Dec-2019
https://dl.acm.org/doi/10.1145/3362693
Efentakis APfoser D(2016)ReHubACM Journal of Experimental Algorithmics10.1145/299019221(1-35)Online publication date: 4-Nov-2016
https://dl.acm.org/doi/10.1145/2990192
Baum MDibbelt JPajor TWagner D(2016)Dynamic Time-Dependent Route Planning in Road Networks with User PreferencesProceedings of the 15th International Symposium on Experimental Algorithms - Volume 968510.1007/978-3-319-38851-9_3(33-49)Online publication date: 5-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-38851-9_3
Show More Cited By

Recommendations

Distributed shortest path query processing on dynamic road networks

Shortest path query processing on dynamic road networks is a fundamental component for real-time navigation systems. In the face of an enormous volume of customer demand from Uber and similar apps, it is desirable to study distributed shortest path ...
ReHub: Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale Networks
Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013

Quite recently, the algorithmic community has focused on solving multiple shortest-path query problems beyond simple vertex-to-vertex queries, especially in the context of road networks. Unfortunately, those advanced query-processing techniques cannot ...
Hub Labels on the database for large-scale graphs with the COLD framework

Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory. An aspect that has only recently attracted attention is the use of databases in combination with graph algorithms, so-called distance oracles, to compute ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Proceedings of the 14th International Symposium on Experimental Algorithms - Volume 9125

June 2015

379 pages

ISBN:9783319200859

Editor:
Evripidis Bampis
Université Pierre et Marie Curie LIP6, Paris, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 June 2015

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Buchhold VSanders PWagner D(2019)Real-time Traffic Assignment Using Engineered Customizable Contraction HierarchiesACM Journal of Experimental Algorithmics10.1145/336269324(1-28)Online publication date: 10-Dec-2019
https://dl.acm.org/doi/10.1145/3362693
Efentakis APfoser D(2016)ReHubACM Journal of Experimental Algorithmics10.1145/299019221(1-35)Online publication date: 4-Nov-2016
https://dl.acm.org/doi/10.1145/2990192
Baum MDibbelt JPajor TWagner D(2016)Dynamic Time-Dependent Route Planning in Road Networks with User PreferencesProceedings of the 15th International Symposium on Experimental Algorithms - Volume 968510.1007/978-3-319-38851-9_3(33-49)Online publication date: 5-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-38851-9_3
Baum MBuchhold VDibbelt JWagner D(2016)Fast Exact Computation of Isochrones in Road NetworksProceedings of the 15th International Symposium on Experimental Algorithms - Volume 968510.1007/978-3-319-38851-9_2(17-32)Online publication date: 5-Jun-2016
https://dl.acm.org/doi/10.1007/978-3-319-38851-9_2

View Options

View options

Media

Figures

Other

Tables

View Table of Contents