Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push

Summary: PowerPush unifies Power Iteration and Forward Push for high-precision SSPPR, achieving O(m log(1/λ)) bound for FwdPush. SpeedPPR delivers fast approximate SSPPR on scale-free graphs with O(n log n log(1/ε)) time, outperforming BePI and FORA in time, accuracy, and index size. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6250
Venue: SIGMOD
Year: 2021
Pagerank: 9.0375634e-05
Overall Rank: 2,173 | 85.10%
DOI: 10.1145/3448016.3457298

Incoming Non-self Citations Over Time

Authors

1. Hao Wu (University of Melbourne)
2. Junhao Gan (University of Melbourne)
3. Zhewei Wei (Renmin University of China)
4. Rui Zhang (Tsinghua University)

BibTeX Citation

@inproceedings{wu_sigmod21,
        title = {{Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push}},
        author = {Wu, Hao and Gan, Junhao and Wei, Zhewei and Zhang, Rui},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3457298},
        url = {https://dl.acm.org/doi/10.1145/3448016.3457298},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,210	Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank	2023	VLDB	7.6352864e-05
4,714	Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme	2023	SIGMOD	6.5497309e-05
5,139	Edge-based Local Push for Personalized PageRank	2022	VLDB	6.3495351e-05
5,157	Efficient Estimation of Pairwise Effective Resistance	2023	SIGMOD	6.3409526e-05
5,968	SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization	2022	VLDB	6.0248475e-05
6,156	QTCS: Efficient Query-Centered Temporal Community Search	2024	VLDB	5.9560993e-05
6,284	Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach	2022	SIGMOD	5.927015e-05
7,861	Efficient Resistance Distance Computation: the Power of Landmark-based Approaches	2023	SIGMOD	5.5302333e-05
8,062	Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches	2023	SIGMOD	5.4949527e-05
8,911	Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach	2024	SIGMOD	5.3483178e-05
9,046	One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor	2026	SIGMOD	5.3251649e-05
10,161	Near-Optimality for Single-Source Personalized PageRank	2026	PODS	5.093636e-05
10,560	Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs	2026	VLDB	5.093636e-05
11,172	Efficient Approximation of Kemeny’s Constant for Large Graphs	2024	SIGMOD	5.093636e-05
11,237	BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank	2024	VLDB	5.093636e-05
11,390	Effective and Efficient PageRank-based Positioning for Graph Visualization	2023	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
556	Fast Incremental and Personalized PageRank	2011	VLDB	0.00016564032
945	Fast Personalized PageRank on MapReduce	2011	SIGMOD	0.00013066956
1,339	Computing Personalized PageRank Quickly by Exploiting Graph Structures	2014	VLDB	0.00011112799
1,414	Fast and Exact Top-k Search for Random Walk with Restart	2012	VLDB	0.00010848387
1,628	Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs	2014	SIGMOD	0.00010186757
1,769	BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs	2015	SIGMOD	9.7969398e-05
1,838	Efficient Ad-hoc Search for Personalized PageRank	2013	SIGMOD	9.6436348e-05
2,073	BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart	2017	SIGMOD	9.2209912e-05
2,225	HubPPR: Effective Indexing for Approximate Personalized PageRank	2017	VLDB	8.9183159e-05
2,362	Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation	2013	VLDB	8.6889619e-05
3,315	Distributed Algorithms on Exact Personalized PageRank	2017	SIGMOD	7.5274958e-05
4,024	TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs	2018	SIGMOD	6.9479974e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,892	Massively Parallel Algorithms for Personalized PageRank	2021	VLDB
2	2,225	HubPPR: Effective Indexing for Approximate Personalized PageRank	2017	VLDB
3	5,250	Parallel Personalized PageRank on Dynamic Graphs	2018	VLDB
4	2,362	Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation	2013	VLDB
5	1,339	Computing Personalized PageRank Quickly by Exploiting Graph Structures	2014	VLDB
6	9,046	One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor	2026	SIGMOD
7	4,024	TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs	2018	SIGMOD
8	10,161	Near-Optimality for Single-Source Personalized PageRank	2026	PODS
9	4,714	Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme	2023	SIGMOD
10	5,139	Edge-based Local Push for Personalized PageRank	2022	VLDB