Carnegie Mellon University / The University of Hong Kong / /
IndustryTerm
baseline brute force solution / local search algorithm / reverse topk search / approximated query algorithm / online query / analytical solution / on-line reverse top-k search algorithm / query processing / Web-stanford4 / real graph-based applications / search technique / Web-stanford-cs3 / real graph applications / on-line reverse top-k algorithm / Web-google4 / proximity search / faster future query processing / search result / reverse top-k search / similarity search / reverse top-k proximity search / Web-stanford / transportation networks / online queries / Web-stanford-cs graph / power law distribution phenomenon / graph-based applications / reverse top-k search precision / web host graph / law.di.unimi.it/datasets.php snap.stanford.edu/data/ / given web page / Web-stanford graph / online querying algorithm / spam web page / co-authorship network / heuristic algorithm / reverse top-k search problem / online query algorithm / ontology networks / Search engines / Web-stanford-cs / power law effect / online algorithm / commodity hardware / web graph / social networks / computing / social network / web domain / relational tuple networks / proximity search problem / linear systems / search engine / power law distribution / web hosts / /
Organization
Hao Su‡ School of Computer Science / Computer Science Department / VLDB Endowment / Department of Computer Science / Stanford University / Carnegie Mellon University / University of Hong Kong / /
Person
Power Method / Hao Su / Nikos Mamoulis / Wei Yu / /
Position
Prime Minister / Rt / first author / model the multi-faceted relationship / General / author / /
Reverse Top-k Search using Random Walk with Restart † ∗ Adams Wei Yu†§ , Nikos Mamoulis§ , Hao Su‡