【摘要】 基于连接树表提出一种新的方法以提高关系数据库关键查询的效率:从模式图中找到所有节点小于Maxsize的连接树以及对应的select模板,将其存储在连接树表joinTree中去,再使用KSORD的搜寻方法来寻找出候选连接树的select模板,从而改善现有KSORD过程所涉及到的广度优先遍历算法的搜索效率.最后通过实验验证,本方法可明显缩短查询时间.更多还原

【Abstract】 A solution based on join tree is proposed to improve the efficiency of keywords search over relational databases(KSORD).In the solution,ajoin tree and a select template are generated from a schema graph.During a query of KSORD,select template of the candidate join tree can be found out efficiently,instead of finding it from a schema graph by Breadth-First Search.Finally,an experiment is verified that the solution is more efficiently than the current KSORD.更多还原