Shortest Path (SP) computation is a fundamental operation in many real-life 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, the Partitioned Shortest Path (PSP) index has never been systematically investigated. Moreover, few studies have explored its index maintenance in dynamic networks. In this paper, we survey the dynamic PSP index and propose a universal scheme for its design and analysis. Specifically, we first review the SP algorithms and put forward a novel structure-based partition method classification to facilitate the selection of partition methods. Furthermore, we summarize the existing Pre-boundary PSP strategy and propose two novel strategies (No-boundary and Post-boundary) to improve its index performance. Lastly, we propose a universal scheme with three dimensions (SP algorithm, partition method, and PSP strategy) to facilitate the analysis and design of the PSP index. Based on this scheme, we put forward five new PSP indexes with a prominent query or update efficiency performance. Extensive experiments are conducted to evaluate the performance of the PSP index and the effectiveness of the proposed techniques, with valuable guidance on the PSP index design.