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
- 5317
- Venue
- SIGMOD
- Year
- 2017
- Pagerank
- 8.6115215e-05
- Overall Rank
- 2,515 | 82.53%
- 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,522 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.6029608e-05 |
| 4,560 |
Massively Parallel Algorithms for Personalized PageRank |
2021 |
VLDB |
6.0788254e-05 |
| 4,670 |
Realtime Top-k Personalized PageRank over Large Graphs on GPUs |
2020 |
VLDB |
6.0027844e-05 |
| 4,688 |
TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs |
2018 |
SIGMOD |
5.9900111e-05 |
| 5,608 |
On Graph Representation for Attributed Hypergraph Clustering |
2025 |
SIGMOD |
5.4108528e-05 |
| 5,666 |
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme |
2023 |
SIGMOD |
5.3824583e-05 |
| 6,310 |
Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks |
2018 |
SIGMOD |
5.111823e-05 |
| 7,081 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
4.833459e-05 |
| 7,815 |
Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation |
2023 |
SIGMOD |
4.640481e-05 |
| 9,252 |
Efficient Resistance Distance Computation: the Power of Landmark-based Approaches |
2023 |
SIGMOD |
4.3648789e-05 |
| 9,330 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.351469e-05 |
| 9,641 |
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs |
2025 |
SIGMOD |
4.3067693e-05 |
| 10,028 |
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor |
2026 |
SIGMOD |
4.1905499e-05 |
| 11,188 |
Effective and Efficient PageRank-based Positioning for Graph Visualization |
2023 |
SIGMOD |
4.1905499e-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,102 |
Leveraging History for Faster Sampling of Online Social Networks |
2015 |
VLDB |
9.5379264e-05 |
| 5,757 |
Scalable and Effective Bipartite Network Embedding |
2022 |
SIGMOD |
5.3386415e-05 |
| 4,760 |
An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs |
2015 |
VLDB |
5.9342555e-05 |
| 7,359 |
An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs |
2022 |
VLDB |
4.7477556e-05 |
| 11,020 |
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework |
2024 |
VLDB |
4.1905499e-05 |
| 4,487 |
On the Embeddability of Random Walk Distances |
2013 |
VLDB |
6.1412716e-05 |
| 4,888 |
READS: A Random Walk Approach for Efficient and Accurate Dynamic SimRank |
2017 |
VLDB |
5.8494448e-05 |
| 5,945 |
Reverse Top-k Search using Random Walk with Restart |
2014 |
VLDB |
5.2583364e-05 |
| 6,493 |
Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs |
2020 |
SIGMOD |
5.0344095e-05 |
| 2,189 |
BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs |
2015 |
SIGMOD |
9.3358152e-05 |