Database Paper Browser

Back to papers

An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs

Summary: TSF, a two-stage random-walk framework for SimRank on dynamic graphs, indexes walks with one-way graphs for efficient updates. Pruning by connectivity and R_q samples yield probabilistic, bounded SimRank estimates with disk-backed storage for billion-edge scalability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11194
Venue
VLDB
Year
2015
Pagerank
5.9188595e-05
Overall Rank
4,791 | 66.68%
DOI
-

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 5 of 5 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