Exact Top-K Nearest Keyword Search In Large Networks
MOD(2015)
摘要
Top-k nearest keyword search has been of interest because of applications ranging from road network location search by keyword to search of information on an RDF repository. We consider the evaluation of a query with a given vertex and a keyword, and the problem is to find a set of k nearest vertices that contain the keyword. The known algorithms for handling this problem only give approximate answers. In this paper, we propose algorithms for top-k nearest keyword search that provide exact solutions and which handle networks of very large sizes. We have also verified the performance of our solutions compared with the best-known approximation algorithms with experiments on real datasets.
更多查看译文
关键词
2-hop Labeling,Nearest Keyword Search,Keyword-lookup Tree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络