Work

A Universal Scheme for Dynamic Partitioned Shortest Path Index

Year: 2026

Type: article

Abstract: Shortest Path (SP) computation is a fundamental operation in many real-world applications such as navigation on road networks, link analysis on social networks, etc. These networks tend to be massive, and graph partitioning is commonly leveraged to scale up the SP algorithms. However, thePartitioned Shortest Path (PSP)index has never been systematically investigated. Moreover, few studies have explored its index maintenance in dynamic networks. In this paper, we review the existing PSP indexes and propose auniversal schemefor the dynamic PSP index to facilitate its design. Specifically, we first summarize the existingPre-Boundarystrategy and propose two novel strategies (No-BoundaryandPost-Boundary) to improve its index performance. Furthermore, we propose a novelstructure-basedPSP classification to facilitate the selection of partition methods and identify three key dimensions in the PSP index. Lastly, we propose auniversal schemecombining these three dimensions (SP algorithm,boundary strategy, andpartition method), and provide a set of systematic design guidelines to facilitate the analysis and design of the PSP index. Based on this scheme, we propose five new PSP indexes with a prominent query or update efficiency performance. Extensive experiments are conducted to evaluate different partition methods, assess the effectiveness of our proposed techniques, and measure the PSP index performance.

Source: IEEE Transactions on Knowledge and Data Engineering

DOI: 10.1109/tkde.2026.3734956