DBScholar

Back to papers

Efficient Partial-Pairs SimRank Search on Large Networks

Summary: Introduces a self-contained “seed germination” framework for partial-pairs SimRank, avoiding precomputed h-go scores and pruning unnecessary edge accesses. Supports all-pairs and single-source cases, achieving up to 38× speedups on graphs with tens of millions of links. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
11356
Venue
VLDB
Year
2015
Pagerank
8.7973939e-05
Overall Rank
2,291 | 84.29%
DOI
10.14778/2735479.2735489

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yu_vldb15,
        title = {{Efficient Partial-Pairs SimRank Search on Large Networks}},
        author = {Yu, Weiren and McCann, Julie A.},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {5},
        pages = {569},
        doi = {10.14778/2735479.2735489},
        url = {https://doi.org/10.14778/2735479.2735489},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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