Back to papers
BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank
Summary: BIRD: a single-source BHPP approximation for weighted bipartite graphs that reduces time to Õ(n) (vs prior Õ(m)) under typical relative-error and constant failure probability. Provable theory and experiments yield orders-of-magnitude speedups—Orkut BHPP in ~7 min.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13457
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.1905499e-05
- Overall Rank
- 11,030 | 23.35%
- DOI
-
10.14778/3665844.3665855
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 911 |
Simrank++: Query Rewriting through Link Analysis of the Click Graph |
2008 |
VLDB |
0.00015381088 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 1,626 |
Fast and Exact Top-k Search for Random Walk with Restart |
2012 |
VLDB |
0.0001108491 |
| 2,110 |
HubPPR: Effective Indexing for Approximate Personalized PageRank |
2017 |
VLDB |
9.5280826e-05 |
| 2,522 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.6029608e-05 |
| 3,715 |
Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank |
2023 |
VLDB |
6.8176818e-05 |
| 4,688 |
TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs |
2018 |
SIGMOD |
5.9900111e-05 |
| 5,431 |
SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization |
2022 |
VLDB |
5.5104776e-05 |
| 5,666 |
Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme |
2023 |
SIGMOD |
5.3824583e-05 |
| 5,757 |
Scalable and Effective Bipartite Network Embedding |
2022 |
SIGMOD |
5.3386415e-05 |
| 7,081 |
Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach |
2022 |
SIGMOD |
4.833459e-05 |
| 9,326 |
Efficient and Accurate SimRank-based Similarity Joins: Experiments, Analysis, and Improvement |
2024 |
VLDB |
4.351469e-05 |
| 9,330 |
Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches |
2023 |
SIGMOD |
4.351469e-05 |
| 9,333 |
Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time |
2023 |
VLDB |
4.351469e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,875 |
Efficient Partial-Pairs SimRank Search on Large Networks |
2015 |
VLDB |
7.9744337e-05 |
| 2,745 |
Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation |
2013 |
VLDB |
8.1831695e-05 |
| 4,670 |
Realtime Top-k Personalized PageRank over Large Graphs on GPUs |
2020 |
VLDB |
6.0027844e-05 |
| 2,522 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.6029608e-05 |
| 5,237 |
Edge-based Local Push for Personalized PageRank |
2022 |
VLDB |
5.6071758e-05 |
| 4,688 |
TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs |
2018 |
SIGMOD |
5.9900111e-05 |
| 2,110 |
HubPPR: Effective Indexing for Approximate Personalized PageRank |
2017 |
VLDB |
9.5280826e-05 |
| 9,216 |
Efficient and Accurate PageRank Approximation on Large Graphs |
2024 |
SIGMOD |
4.3674946e-05 |
| 6,310 |
Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks |
2018 |
SIGMOD |
5.111823e-05 |
| 1,528 |
Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank |
2020 |
VLDB |
0.00011489661 |