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
This paper surveys dynamic partitioned shortest path indexes, proposes a universal scheme for their design and analysis, introduces new strategies, and demonstrates improved performance through extensive experiments.
Contribution
It introduces a universal scheme for dynamic PSP index design, classifies partition methods, and proposes new strategies with improved efficiency.
Findings
Proposed a universal scheme for PSP index design.
Introduced two novel PSP strategies: No-boundary and Post-boundary.
Demonstrated improved query and update performance through experiments.
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Network Packet Processing and Optimization · Graph Theory and Algorithms
