Ranking strategy of keyword search over relational databases
Zhang Hua-bing · Jisuanji gongcheng yu sheji · 2008
Keyword search techniques based on the relational databases are similar with getting relative data from databases by search engines.A ranking strategy of result sets is presented aimed at the efficiency problem in keyword search that based on book index data-bases.All query answers' ranking depended on the similarity value between query sequence and result tuple trees.According to similarity functions that are produced by result sets on traditional information retrieval systems,different similarity functions are given based on relational databases.In addition,related influence factors are analyzed and redefined.And the improvement is proved reasonable by analyzing and verifying on simple databases.