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

  • Alexandros Efentakis
  • Dieter Pfoser
  • Yannis Vassiliou
Conference paper

DOI: 10.1007/978-3-319-20086-6_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9125)
Cite this paper as:
Efentakis A., Pfoser D., Vassiliou Y. (2015) SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks. In: Bampis E. (eds) Experimental Algorithms. SEA 2015. Lecture Notes in Computer Science, vol 9125. Springer, Cham


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”.


Shortest-paths k-nearest neighbors kNN Salt framework 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Alexandros Efentakis
    • 1
  • Dieter Pfoser
    • 2
  • Yannis Vassiliou
    • 3
  1. 1.Research Center “Athena”MarousiGreece
  2. 2.Department of Geography and GeoInformation ScienceGeorge Mason UniversityFaifaxUS
  3. 3.National Technical University of AthensZografouGreece

Personalised recommendations