Efficient processing of keyword queries over graph databases for finding effective answers
作者：
Highlights：
• We define a new measure of relevance of a node in the graph to a keyword query.
• We propose an extended answer structure for a top-k query over graph databases.
• We propose an inverted list index and search algorithm to find top-k answer trees.
• We enhanced the basic method for more efficient and scalable processing the query.
• Experiments show that the proposed method can find effective top-k answers efficiently.
摘要
•We define a new measure of relevance of a node in the graph to a keyword query.•We propose an extended answer structure for a top-k query over graph databases.•We propose an inverted list index and search algorithm to find top-k answer trees.•We enhanced the basic method for more efficient and scalable processing the query.•Experiments show that the proposed method can find effective top-k answers efficiently.
论文关键词：Graph database,Keyword search,Top-k query processing
论文评审过程：Received 4 August 2013, Revised 4 June 2014, Accepted 18 August 2014, Available online 17 September 2014.
论文官网地址：https://doi.org/10.1016/j.ipm.2014.08.002
