DBScholar

Back to papers

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs

Summary: PRSim delivers sublinear-time single-source SimRank queries on large power-law graphs with an index of size O(m). Query cost hinges on reverse PageRank; PRSim outperforms prior work in speed and accuracy with a compact index, and it scales to graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5747
Venue
SIGMOD
Year
2019
Pagerank
5.4658632e-05
Overall Rank
8,212 | 43.66%
DOI
10.1145/3299869.3319873

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wei_sigmod19,
        title = {{PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs}},
        author = {Wei, Zhewei and He, Xiaodong and Xiao, Xiaokui and Wang, Sibo and Liu, Yu and Du, Xiaoyong and Wen, Ji-Rong},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3319873},
        url = {https://dl.acm.org/doi/10.1145/3299869.3319873},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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