Efficient processing of keyword queries over graph databases for finding effective answers
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