Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
Guanhao Hou, Qintian Guo, Fangyuan Zhang, Sibo Wang, Zhewei Wei

TL;DR
This paper introduces an efficient incremental indexing scheme for Personalized PageRank on evolving graphs, achieving constant-time updates and significantly improving over existing methods without losing query accuracy.
Contribution
It proposes a novel incremental index-update scheme for Personalized PageRank that operates in expected O(1) time per update on dynamic graphs.
Findings
Achieves orders of magnitude faster update times than existing methods
Supports approximate Personalized PageRank queries with guarantees
Reduces space consumption with a new sampling scheme
Abstract
{\em Personalized PageRank (PPR)} stands as a fundamental proximity measure in graph mining. Since computing an exact SSPPR query answer is prohibitive, most existing solutions turn to approximate queries with guarantees. The state-of-the-art solutions for approximate SSPPR queries are index-based and mainly focus on static graphs, while real-world graphs are usually dynamically changing. However, existing index-update schemes can not achieve a sub-linear update time. Motivated by this, we present an efficient indexing scheme to maintain indexed random walks in expected time after each graph update. To reduce the space consumption, we further propose a new sampling scheme to remove the auxiliary data structure for vertices while still supporting index update cost on evolving graphs. Extensive experiments show that our update scheme achieves orders of magnitude speed-up on…
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 · Data Mining Algorithms and Applications · Graph Theory and Algorithms
