DBScholar

Back to papers

An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs

Summary: TSF enables fast SimRank top-k search on large dynamic graphs via two-stage random-walk sampling and compact one-way-graph indexes. Incremental index updates, connectivity-based pruning, probabilistic score guarantees, and disk storage scale to billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
11382
Venue
VLDB
Year
2015
Pagerank
6.8273894e-05
Overall Rank
4,216 | 71.08%
DOI
10.14778/2757807.2757809

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{shao_vldb15,
        title = {{An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs}},
        author = {Shao, Yingxia and Cui, Bin and Chen, Lei and Liu, Mingming and Xie, Xing},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {8},
        pages = {838--849},
        doi = {10.14778/2757807.2757809},
        url = {https://doi.org/10.14778/2757807.2757809},
        year = {2015}
}

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