标题:Cascading top-k keyword search over relational databases
作者:Yu, Ziqiang ;Yu, Xiaohui ;Liu, Yang
通讯作者:Yu, Z
作者机构:[Yu, Ziqiang ;Yu, Xiaohui ;Liu, Yang ] School of Computer Science and Technology, Shandong University, Jinan, China;[Yu, Xiaohui ] School of Informati 更多
会议名称:14th ACM International Workshop on Data Warehousing and Online Analytical Processing, DOLAP'11
会议日期:28 October 2011 through 28 October 2011
来源:International Conference on Information and Knowledge Management, Proceedings
出版年:2011
页码:95-99
DOI:10.1145/2064676.2064693
关键词:keyword search; ranking; relational database
摘要:Keyword search over relational databases has recently received significant attention. Many solutions and prototypes have been developed. However, due to large memory consumption requirements and unpredictable running time, most of them cannot be applied directly to situations where memory is limited and quick response is required, such as when performing keyword search over databases in mobile devices as part of the OLAP funtionalities. In this paper, we attack the keyword search problem from a new perspective, and propose a cascading top-k keyword search algorithm, which generates supernodes in each step of search instead of computing the Steiner trees as done in many existing approaches. This new algorithm consumes less memory and significantly reduces the response time. Experiments show that the method can achieve high search efficiency compared with the state-of-the-art approaches. © 2011 ACM.
收录类别:EI;SCOPUS
Scopus被引频次:1
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-83255166534&doi=10.1145%2f2064676.2064693&partnerID=40&md5=bdd7b3d45b5ec3583f1126cb5336b3e5
TOP