Exact Top-k Nearest Keyword Search in Large Networks

ACM SIGMOD Conference, pp. 393-404, 2015.

Cited by: 33|Bibtex|Views58|DOI:https://doi.org/10.1145/2723372.2749447
EI
Other Links: dl.acm.org|academic.microsoft.com|dblp.uni-trier.de

Abstract:

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 ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments