Tags:Batch Processing, Landmark-embedding and Shortest Paths
Abstract:
Processing shortest path queries is a basic operation in many graph problems. Both preprocessing-based and batch processing techniques have been proposed to speed up the computation of a single shortest path by amortizing its costs. However, both of these approaches suffer from limitations. The former techniques are not applicable to dynamic scenarios due to preprocessing overhead, while the latter require coordinates and cannot be used on non-spatial graphs. In this paper, we address both limitations and propose novel techniques for batch processing shortest paths queries using landmarks. We show how preprocessing can be avoided entirely by integrating the computation of landmark distances into query processing. Our experimental results demonstrate that our techniques consistently outperform the state of the art on both spatial and non-spatial graphs with a maximum speed up of 4.25x in a dynamic scenario.
Online Landmark-Based Batch Processing of Shortest Path Queries