2014/11/02 by Alexandros Efentakis, Dieter Pfoser, Efentakis, Alexandros +3
Computer Science · Engineering · #Advanced Database Systems and Queries #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2 #Graph Theory and Algorithms #I.2.8 #Traffic Prediction and Management Techniques
paper · pdf · doi:10.48550/arxiv.1411.0257
openalex publication_date 2014/11/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Although recent scientific output focuses on multiple shortest-path problem\ndefinitions for road networks, none of the existing solutions does efficiently\nanswer all different types of SP queries. This work proposes SALT, a novel\nframework that not only efficiently answers SP related queries but also\nk-nearest neighbor queries not handled by previous approaches. Our solution\noffers all the benefits needed for practical use-cases, including excellent\nquery performance and very short preprocessing times, thus making it also a\nviable option for dynamic road networks, i.e., edge weights changing frequently\ndue to traffic updates. The proposed SALT framework is a deployable software\nsolution capturing a range of network-related query problems under one\n"algorithmic hood".\n