Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs
Summary: FLoS provides exact top-k proximity via unified local search on random-walk measures. It uses no-local-optimum to derive monotone bounds that converge to exact results; generalizes across measures via cross-measure relations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yubao Wu (Case Western Reserve University)
- 2. Ruoming Jin (Kent State University)
- 3. Xiang Zhang (Case Western Reserve University)
BibTeX Citation
@inproceedings{wu_sigmod14,
title = {{Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs}},
author = {Wu, Yubao and Jin, Ruoming and Zhang, Xiang},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2610500},
url = {https://dl.acm.org/doi/10.1145/2588555.2610500},
year = {2014}
}
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,414 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB | 0.00010848387 |
| 1,838 | Efficient Ad-hoc Search for Personalized PageRank | 2013 | SIGMOD | 9.6436348e-05 |
| 3,149 | Assessing and Ranking Structural Correlations in Graphs | 2011 | SIGMOD | 7.7066337e-05 |
| 4,572 | On the Embeddability of Random Walk Distances | 2013 | VLDB | 6.62325e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,149 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB |
| 2 | 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 3 | 10,460 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 4 | 1,394 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD |
| 5 | 5,815 | Reverse Top-k Search using Random Walk with Restart | 2014 | VLDB |
| 6 | 6,940 | Exact Top-k Nearest Keyword Search in Large Networks | 2015 | SIGMOD |
| 7 | 4,216 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB |
| 8 | 1,049 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB |
| 9 | 8,493 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB |
| 10 | 1,414 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB |