Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

A Universal Scheme for Dynamic Partitioned Shortest Path Index: Survey, Improvement, and Experiments

Mengxuan Zhang, Xinjie Zhou, Lei Li, Ziyi Liu, Goce Trajcevski, Yan Huang, Xiaofang Zhou

TL;DR

The paper tackles the scalability of dynamic PSP indexes by proposing a universal three-dimensional PSP design scheme (SP algorithm × partition method × PSP strategy). It introduces two novel PSP strategies (No-Boundary and Post-Boundary) and a pruning-based overlay optimization, and demonstrates five new PSP indexes that leverage different dimension combinations. Through extensive experiments on diverse datasets, the work provides practical guidance on partition choices, strategy selection, and when to prefer query- versus update-oriented designs. The results offer a systematic framework for constructing efficient PSP indexes and outline future directions for I/O-efficient, automatic, and high-throughput PSP systems in dynamic graphs.

Abstract

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.

A Universal Scheme for Dynamic Partitioned Shortest Path Index: Survey, Improvement, and Experiments

TL;DR

The paper tackles the scalability of dynamic PSP indexes by proposing a universal three-dimensional PSP design scheme (SP algorithm × partition method × PSP strategy). It introduces two novel PSP strategies (No-Boundary and Post-Boundary) and a pruning-based overlay optimization, and demonstrates five new PSP indexes that leverage different dimension combinations. Through extensive experiments on diverse datasets, the work provides practical guidance on partition choices, strategy selection, and when to prefer query- versus update-oriented designs. The results offer a systematic framework for constructing efficient PSP indexes and outline future directions for I/O-efficient, automatic, and high-throughput PSP systems in dynamic graphs.

Abstract

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.
Paper Structure (29 sections, 11 theorems, 1 equation, 24 figures, 4 tables, 3 algorithms)

This paper contains 29 sections, 11 theorems, 1 equation, 24 figures, 4 tables, 3 algorithms.

Table of Contents

  1. Introduction
  2. Preliminary
  3. Shortest Path Algorithms in PSP Index
  4. Structure-based Partition Method Classification
  5. Planar Partitioning
  6. Planar Partitioning Algorithms
  7. PSP Indexes with Planar Partitioning
  8. Core-Periphery Partitioning
  9. Hierarchical Partitioning
  10. Summary and Discussion
  11. Novel Partitioned Shortest Path Strategies
  12. Traditional Pre-Boundary Strategy
  13. Novel No-Boundary and Post-Boundary Strategies
  14. Index Update for Different PSP Strategies
  15. Pruning-based Overlay Graph Optimization
  16. ...and 14 more sections

Key Result

Theorem 1

$\forall s,t\in B, d_G(s,t)=d_{\tilde{L}}(s,t)$.

Figures (24)

  • Figure 1: Performance Comparison of SP Algorithms
  • Figure 2: Example Graph $G$ and Overlay Graph $\tilde{G}$
  • Figure 3: Different Partition Structures
  • Figure 4: Traditional PSP Strategy (Pre-boundary Strategy)
  • Figure 5: No-Boundary and Post-Boundary Strategies
  • ...and 19 more figures

Theorems & Definitions (16)

  • Example 1
  • Definition 1
  • Definition 2
  • Definition 3
  • Theorem 1
  • Theorem 2
  • Lemma 3
  • Lemma 4
  • Lemma 5
  • Lemma 6
  • ...and 6 more