Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant key word query. In this paper, we focus on how to find the top-k answers in relational databases for continuous keyword queries efficiently. As answering a keyword query involves a large number of join operations between relations, reevaluating the keyword query when the database is updated is rather expensive. We propose a method to compute a range for the future relevance score of query answers. For each keyword query, our method computes a state of the query evaluation process, which only contains a small amount of data and can be used to main tain top-k answers when the database is continually growing. The experimental results show that our method can be used to solve the problem of responding to continuous keyword searches for a relational database that is updated frequently.
Relational databases keyword search continuous queries incremental maintenance
Yanwei Xu Yoshiharu Ishikawa Jihong Guan
Department of Computer Science and Technology, Tongji University, Shanghai, China Graduate School of Information Technology Center, Nagoya University, Japan Graduate School of Information Science, Nago Department of Computer Science and Technology, Tongji University, Shanghai, China
国际会议
11th International Conference,WAIM 2010(第十一届网络时代管理国际会议)
九寨沟
英文
755-767
2010-07-14（万方平台首次上网日期，不代表论文的发表时间）