DBScholar

Back to papers

Efficient SimRank-based Similarity Join Over Large Graphs

Summary: Introduces SimRank-based joins over large graphs, pruning candidate pairs with estimated shortest-path upper bounds. The h-go cover selectively materializes SimRank scores for efficient pair verification and supports scalable partition-based processing. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10902
Venue
VLDB
Year
2013
Pagerank
9.6948178e-05
Overall Rank
1,812 | 87.57%
DOI
10.14778/2535992.2535994

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zheng_vldb13,
        title = {{Efficient SimRank-based Similarity Join Over Large Graphs}},
        author = {Zheng, Weiguo and Zou, Lei and Feng, Yansong and Chen, Lei and Zhao, Dongyan},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {7},
        pages = {493--504},
        doi = {10.14778/2535992.2535994},
        url = {https://doi.org/10.14778/2535992.2535994},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

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