Keyword Search on Large Graphs: A Survey

Data Science and Engineering

Wu Yao¹  Jianye Yang¹  Wenjie Zhang² 

[1] Hunan University, Changsha, China;University of New South Wales, Sydney, NSW, Australia;

关键词: Keyword search;    Big graph;    Algorithm;    Index structure;   

DOI  :  10.1007/s41019-021-00154-4

来源: Springer

【 摘 要 】

With the prevalence of Internet access and online services, various big graphs are generated in many real applications (e.g., online social networks and knowledge graphs). An important task on analyzing and mining these graphs is keyword search. Essentially, given a graph G and query Q associated with a set of keywords, the keyword search aims to find a substructure (e.g., rooted tree or subgraph) S in G such that nodes in S collectively cover part of or all keywords in Q, and in the meanwhile, S is optimal on some user specified semantics. Keyword search on graphs can be applied in many real-life applications, such as point-of-interests recommendation and web search facility. In spite of the great importance of graph keyword search, we, however, notice that the latest survey on this topic is far out of date. Consequently, there is prompt need to conduct a comprehensive survey in this research direction. Motivated by this, in this survey, we systematically review graph keyword search studies by classifying the existing works into different categories according to the specific problem definition. This survey aims to provide the researchers a comprehensive understanding of existing graph keyword search solutions.

【 授权许可】

CC BY