Shortest path (SP) computation is the fundamental operation in various networks such as urban networks, logistic networks, communication networks, social networks, etc. With the development of technology and societal expansions, those networks tend to be massive. This, in turn, causes deteriorated performance of SP computation, and graph partitioning is commonly leveraged to scale up the SP algorithms. However, the partitioned shortest path (PSP) index has never been systematically investigated and theoretically analyzed, and there is a lack of experimental comparison among different PSP indexes. Moreover, few studies have explored PSP index maintenance in dynamic networks. Therefore, in this paper, we systematically analyze the dynamic PSP index by proposing a universal scheme for it. Specifically, we first propose two novel partitioned shortest path strategies (No-boundary and Post-boundary strategies) to improve the performance of PSP indexes and design the corresponding index maintenance approaches to deal with dynamic scenarios. Then we categorize the partition methods from the perspective of partition structure to facilitate the selection of partition methods in the PSP index. Furthermore, we propose a universal scheme for designing the PSP index by coupling its three dimensions (i.e. PSP strategy, partition structure, and SP algorithm). Based on this scheme, we propose five new PSP indexes with prominent performance in either query or update efficiency. Lastly, extensive experiments are implemented to demonstrate the effectiveness of the proposed PSP scheme, with valuable guidance provided on the PSP index design.

翻译：最短路径(SP)计算是城市网络、物流网络、通信网络、社交网络等多种网络中的基本操作。随着技术发展和社会扩张，这些网络规模日益庞大，导致SP计算性能下降。图分区技术常被用于扩展SP算法的规模，然而分区最短路径(PSP)索引从未得到系统性研究和理论分析，不同PSP索引之间也缺乏实验比较。此外，鲜有研究探索动态网络中PSP索引的维护问题。因此，本文通过提出PSP索引的通用方案，系统性地分析了动态PSP索引。具体而言，我们首先提出两种新型分区最短路径策略（无边界策略和边界后策略）以提升PSP索引性能，并设计相应的索引维护方法以应对动态场景。随后，我们从分区结构角度对分区方法进行分类，以促进PSP索引中分区方法的选择。进一步地，我们通过耦合PSP索引的三个维度（即PSP策略、分区结构和SP算法）提出设计PSP索引的通用方案。基于该方案，我们提出五种在查询效率或更新效率上表现突出的新型PSP索引。最后，通过大量实验验证所提PSP方案的有效性，并为PSP索引设计提供有价值的指导。