DBScholar

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
5378
Venue
SIGMOD
Year
2017
Pagerank
9.2209912e-05
Overall Rank
2,073 | 85.78%
DOI
10.1145/3035918.3035950

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jung_sigmod17,
        title = {{BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart}},
        author = {Jung, Jinhong and Park, Namyong and Sael, Lee and Kang, U},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3035950},
        url = {https://dl.acm.org/doi/10.1145/3035918.3035950},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Rank Citing Paper Year Venue Pagerank
2,173 Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push 2021 SIGMOD 9.0375634e-05
3,892 Massively Parallel Algorithms for Personalized PageRank 2021 VLDB 7.0430255e-05
4,024 TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs 2018 SIGMOD 6.9479974e-05
4,225 Realtime Top-k Personalized PageRank over Large Graphs on GPUs 2020 VLDB 6.821373e-05
4,714 Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme 2023 SIGMOD 6.5497309e-05
5,741 Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks 2018 SIGMOD 6.1029326e-05
5,960 On Graph Representation for Attributed Hypergraph Clustering 2025 SIGMOD 6.0274692e-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,188 Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation 2023 SIGMOD 5.4703528e-05
9,046 One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor 2026 SIGMOD 5.3251649e-05
9,769 Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs 2025 SIGMOD 5.2209769e-05
11,390 Effective and Efficient PageRank-based Positioning for Graph Visualization 2023 SIGMOD 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.

Previous Page 1 / 1 Next

Semantically Similar Papers