Stable Skyline Path Query Over Edge-Labeled Temporal Graphs

Abstract

In recent years, there has been a surge in the development of path query-based applications, leading to significant research efforts dedicated to addressing the path query problem. Previous studies have primarily focused on either path queries in temporal graphs or skyline path queries in static graphs, often overlooking the critical temporal aspect. Moreover, edge-labeled temporal graphs, frequently encountered in real-world scenarios such as traffic networks with labels like “expressway” or “provincial road,” have not been adequately considered in the context of skyline path queries that account for path stability amidst graph updates. However, in this paper, we introduce a novel approach for addressing the stability of skyline path queries in the context of edge-labeled temporal graphs. To tackle this challenge, we first introduce a globally updated Main Point (MP) index. Building upon this index, we propose a partition-based method to facilitate stable skyline path queries in temporal graphs. Our extensive experimental evaluations demonstrate the effectiveness and efficiency of the algorithm we present.