DBScholar

Back to papers

Reverse Top-k Search using Random Walk with Restart

Summary: Reverse top-k proximity search using random walk with restart (RWR) for large, heterogeneous graphs. An indexing-based online algorithm dramatically reduces computation and storage compared to naïve RWR, enabling scalable reverse top-k queries on big graph datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11106
Venue
VLDB
Year
2014
Pagerank
6.0777346e-05
Overall Rank
5,815 | 60.11%
DOI
10.14778/2732269.2732276

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yu_vldb14,
        title = {{Reverse Top-k Search using Random Walk with Restart}},
        author = {Yu, Adams Wei and Mamoulis, Nikos and Su, Hao},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {5},
        pages = {401--412},
        doi = {10.14778/2732269.2732276},
        url = {https://doi.org/10.14778/2732269.2732276},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,073 BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart 2017 SIGMOD 9.2209912e-05
6,125 The Minimum Wiener Connector Problem 2015 SIGMOD 5.9675732e-05
9,356 Reverse k Nearest Neighbors Query Processing: Experiments and Analysis 2015 VLDB 5.282937e-05
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