Study on ranking keyword search results in relational database based on data graph
Yang Shu-xi · Jisuanji yingyong yanjiu · 2014
Aiming at the problem of ranking keyword search results in relational database based on data graph,this paper presented two factors based results ranking method which combined result's structure weight and content matching. It often used content matching in field of information retrieve. Firstly,it used result's path weight to measure the compact degree among keywords,results could get a rough ranking according that. Then for results with the same structure weight,keyword frequency in information tuple and amount of information that contain keywords were used to further ranking. Experiment and analysis shows that this ranking method can improve result precision by making highly relevant results in front of result set.