FrogWild! – Fast PageRank Approximations on Graph Engines
Summary: FrogWild! fast PageRank approximations via quantized power iteration with parallel random walks. Partial GraphLab mirror sync cuts cross-node traffic, induces walk correlations; bound shows near-PageRank accuracy; faster, up to 7x on Twitter. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,515 | BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart | 2017 | SIGMOD | 8.6115215e-05 |
| 5,089 | TCUDB: Accelerating Database with Tensor Processors | 2022 | SIGMOD | 5.7017353e-05 |
| 11,652 | Ariadne: Online Provenance for Big Graph Analytics | 2019 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019040811 |
| 1,679 | Navigating the Maze of Graph Analytics Frameworks using Massive Graph Datasets | 2014 | SIGMOD | 0.00010926732 |
Previous
Page 1 / 1
Next