Database Paper Browser

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
10918
Venue
VLDB
Year
2014
Pagerank
5.2616887e-05
Overall Rank
5,946 | 58.64%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,537 BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart 2017 SIGMOD 8.5834428e-05
7,157 The Minimum Wiener Connector Problem 2015 SIGMOD 4.8144713e-05
9,309 Reverse k Nearest Neighbors Query Processing: Experiments and Analysis 2015 VLDB 4.3571035e-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