A Top-k keywords searching approach based on the relationship of keywords

There may exist a specific relationship between the keywords if an XML multi-keywords search has more than one answers. Such relationship can be speculated by SLCA. This paper proposes a user-friendly Top-k keywords searching approach based on the relationship of keywords. The SLCA of a keyword search is first obtained by the LISA II algorithm. Then, the structure of SLCA is leveraged to speculate the relationship of keywords, i.e., the keyword search is translated into twig queries. Next, the relationship of keywords can be estimated by the structure of twig queries and these twig queries are ranked according to the relationships of keywords. Finally, all results of the ordered twig queries are obtained by TJFast algorithm. The experimental results demonstrated that the approach presented in this paper has the high precision, and can efficiently meet the user´s needs as well.