Database Paper Browser

Back to papers

Efficient SimRank-based Similarity Join Over Large Graphs

Summary: Efficient SimRank-based similarity join over large graphs. Prunes candidate vertex pairs with an estimated shortest-path distance upper bound; introduces h-go cover, a compact index to rapidly compute SimRank from a small materialized set, plus a partition-based extension with solid theory and experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10714
Venue
VLDB
Year
2013
Pagerank
9.5155578e-05
Overall Rank
2,117 | 85.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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