Progressive Ranking for Efficient Keyword Search over Relational Databases
Progressive Ranking for Efficient Keyword Search over Relational Databases
复制标题
DOI：
10.1007/978-3-540-70504-8_20
复制
发表时间：
2008-07
期刊：
影响因子：
--
通讯作者：
Guoliang Li;Jianhua Feng;Feng Lin;Lizhu Zhou
中科院分区：
文献类型：
--
作者：
Guoliang Li;Jianhua Feng;Feng Lin;Lizhu Zhou
现有的关系数据库关键字搜索方法通常首先生成所有可能的结果，然后根据它们各自的等级对它们进行排序。这些传统的方法对于识别排名最高的前k个答案是低效的。本文研究了关系数据库中前k个答案的逐步识别问题。逐步识别答案的方法是非常可取的，因为它更早地生成排名更高的结果，从而减少响应用户查询的延迟。我们已经实现了我们提出的方法，实验结果表明，我们的方法优于现有的国家的最先进的方法，并取得更好的搜索性能。
The existing approaches of keyword search over relational databases usually first generate all possible results composed of relevant tuples and then sort them based on their individual ranks. These traditional methods are inefficient to identify thetop-kanswers with the highest ranks. This paper studies the problem of progressively identifying thetop-kanswers from the relational databases. The approach of progressively identifying the answers is very desirable as it generates the higher ranked results earlier thereby reducing the delay in responding to the user query. We have implemented our proposed method, and the experimental results show that our method outperforms existing state-of-the-art approaches and achieves much better search performance.