2011/03/14 by Yanwei Xu, Xu, Yanwei
Computer Science · #Databases (cs.DB) #FOS: Computer and information sciences #Information Retrieval (cs.IR) #cs.DB #cs.IR
paper · pdf · doi:10.48550/arxiv.1103.2651
This paper has been withdrawn by the author due to a crucial error of the algorithms
arxiv created 2011/09/07 · arxiv updated 2015/03/18
Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying data schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term interests on specific topics. To deal with such a situation, it is necessary to build effective and efficient facility in database systems to support continual keyword queries evaluation. In this paper, we propose an efficient method for continual keyword queries answering over relational databases. The proposed method consists of two core algorithms. The first one computes a set of potential top-k results by evaluating the ranges of the future relevance score for every query result and create a light-weight state for each keyword query. The second one uses these states to maintain the top-k results of keyword queries when the database is continually growing. Experimental results validate the effectiveness and efficiency of the proposed method.