Back to papers
BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart
Summary: BePI uses block-elimination preprocessing and a preconditioned iterative solver to scale RWR on billion-edge graphs. Fast queries and low memory come from nonzero reduction and preconditioning, enabling 100x larger graphs with 130x less memory and 9x faster RWR.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5316
- Venue
- SIGMOD
- Year
- 2017
- Pagerank
- 8.5834428e-05
- Overall Rank
- 2,537 | 82.36%
- DOI
-
10.1145/3035918.3035950
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 2,827 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.0551884e-05 |
| 4,562 |
Massively Parallel Algorithms for Personalized PageRank |
2021 |
VLDB |
6.0846728e-05 |
| 4,671 |
Realtime Top-k Personalized PageRank over Large Graphs on GPUs |
2020 |
VLDB |
6.0085645e-05 |
| 4,733 |
TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs |
2018 |
SIGMOD |
5.9631943e-05 |
| 5,655 |
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme |
2023 |
SIGMOD |
5.387631e-05 |
| 5,827 |
On Graph Representation for Attributed Hypergraph Clustering |
2025 |
SIGMOD |
5.3113542e-05 |
| 6,309 |
Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks |
2018 |
SIGMOD |
5.1167347e-05 |
| 7,086 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
4.8381004e-05 |
| 7,850 |
Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation |
2023 |
SIGMOD |
4.6362484e-05 |
| 9,245 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3690661e-05 |
| 9,325 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.3556432e-05 |
| 9,642 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4.3109001e-05 |
| 10,028 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
4.1945683e-05 |
| 11,186 |
Effective and Efficient PageRank-based Positioning for Graph Visualization |
2023 |
SIGMOD |
4.1945683e-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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,108 |
Leveraging History for Faster Sampling of Online Social Networks |
2015 |
VLDB |
9.5327714e-05 |
| 5,766 |
Scalable and Effective Bipartite Network Embedding |
2022 |
SIGMOD |
5.3363253e-05 |
| 4,791 |
An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs |
2015 |
VLDB |
5.9188595e-05 |
| 7,363 |
An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs |
2022 |
VLDB |
4.7523184e-05 |
| 11,017 |
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework |
2024 |
VLDB |
4.1945683e-05 |
| 4,527 |
On the Embeddability of Random Walk Distances |
2013 |
VLDB |
6.1083926e-05 |
| 4,922 |
READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank |
2017 |
VLDB |
5.8233726e-05 |
| 5,946 |
Reverse Top-k Search using Random Walk with Restart |
2014 |
VLDB |
5.2616887e-05 |
| 6,498 |
Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs |
2020 |
SIGMOD |
5.0392468e-05 |
| 2,210 |
BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs |
2015 |
SIGMOD |
9.2856573e-05 |