Database Paper Browser

Back to papers

Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks

Summary: BLOG targets heavy-hitter PPR queries: pairwise AHH, reverse AHH, and multi-source reverse AHH. By combining Monte-Carlo sampling with backward propagation and logarithmic bucketing to handle high in-degree nodes, it beats SOTA on all three queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5565
Venue
SIGMOD
Year
2018
Pagerank
5.1167347e-05
Overall Rank
6,309 | 56.12%
DOI
10.1145/3183713.3196919

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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