DBScholar

Back to papers

One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor

Summary: Introduces StackIndex: a single stack-style meta-index built via loop-erased α-random walks with a large ᾱ that can be efficiently transformed to answer SSPPR for any damping factor α without rebuilding. Provably O(ω n) time/space construction, supports dynamic updates and yields large empirical speedups. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7523
Venue
SIGMOD
Year
2026
Pagerank
5.3251649e-05
Overall Rank
9,046 | 37.94%
DOI
10.1145/3749176

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhou_sigmod26,
        title = {{One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor}},
        author = {Zhou, Junjie and Liao, Meihao and Li, Rong-Hua and Lin, Longlong and Wang, Guoren},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3749176},
        url = {https://dl.acm.org/doi/10.1145/3749176},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,161 Near-Optimality for Single-Source Personalized PageRank 2026 PODS 5.093636e-05
Previous Page 1 / 1 Next

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
1,339 Computing Personalized PageRank Quickly by Exploiting Graph Structures 2014 VLDB 0.00011112799
1,769 BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs 2015 SIGMOD 9.7969398e-05
2,073 BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart 2017 SIGMOD 9.2209912e-05
2,173 Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push 2021 SIGMOD 9.0375634e-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
2,618 Combating Web Spam with TrustRank 2004 VLDB 8.3380047e-05
3,616 Parallel Local Graph Clustering 2016 VLDB 7.2559471e-05
4,714 Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme 2023 SIGMOD 6.5497309e-05
5,913 Efficient Estimation of Heat Kernel PageRank for Local Clustering 2019 SIGMOD 6.0439971e-05
6,284 Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach 2022 SIGMOD 5.927015e-05
8,062 Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches 2023 SIGMOD 5.4949527e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 2,362 Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation 2013 VLDB
2 8,062 Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches 2023 SIGMOD
3 5,250 Parallel Personalized PageRank on Dynamic Graphs 2018 VLDB
4 4,024 TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs 2018 SIGMOD
5 1,339 Computing Personalized PageRank Quickly by Exploiting Graph Structures 2014 VLDB
6 2,173 Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push 2021 SIGMOD
7 2,225 HubPPR: Effective Indexing for Approximate Personalized PageRank 2017 VLDB
8 6,284 Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach 2022 SIGMOD
9 10,161 Near-Optimality for Single-Source Personalized PageRank 2026 PODS
10 4,714 Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme 2023 SIGMOD