Indexing Graphs for Shortest Beer Path Queries - IDEX Université Côte d'Azur
Communication Dans Un Congrès Année : 2024

Indexing Graphs for Shortest Beer Path Queries

Résumé

A beer graph is an edge-weighted graph G = (V,E,ω) with beer vertices B ⊆ V. A beer path between two vertices s and t of a beer graph is a path that connects s and t and visits at least one vertex in B. The beer distance between two vertices is the weight of a shortest beer path, i.e. a beer path having minimum total weight. A graph indexing scheme is a two-phase method that constructs an index data structure by a one-time preprocessing of an input graph and then exploits it to compute (or accelerate the computation of) answers to queries on structures of the graph dataset. In the last decade, such indexing schemes have been designed to perform, effectively, many relevant types of queries, e.g. on reachability, and have gained significant popularity in essentially all data-intensive application domains where large number of queries have to be routinely answered (e.g. journey planners), since they have been shown, through many experimental studies, to offer extremely low query times at the price of limited preprocessing time and space overheads. In this paper, we showcase that an indexing scheme, to efficiently execute queries on beer distances or shortest beer paths for pairs of vertices of a beer graph, can be obtained by adapting the highway labeling, a recently introduced indexing method to accelerate the computation of classical shortest paths. We design a preprocessing algorithm to build a whl index, i.e. a weighted highway labeling of a beer graph, and show how it can be queried to compute beer distances and shortest beer paths. Through extensive experimentation on real networks, we empirically demonstrate its practical effectiveness and superiority, in terms of offered trade-off between preprocessing time, space overhead and query time, with respect to the state-of-the-art.
Fichier principal
Vignette du fichier
OASIcs.ATMOS.2024.2.pdf (924.88 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04724158 , version 1 (07-10-2024)

Identifiants

Citer

David Coudert, Andrea d'Ascenzo, Mattia d'Emidio. Indexing Graphs for Shortest Beer Path Queries. 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), Sep 2024, London, United Kingdom. ⟨10.4230/OASIcs.ATMOS.2024.2⟩. ⟨hal-04724158⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More