Efficient Incremental Top-k Keyword Search in Relational Databases

摘要

Keyword search in relational databases has attracted a lot of research interests in recent yeas. It is widely realized that supporting keyword search in relational databases will provide a large range of high quality services. As involving a large number of join operations between relations when answering a keyword query, efficiency issue is one of the most important facts to consider when developing such a keyword search system, especially when the database is updating frequently at the same time. In this paper, we study how to efficiently answer keyword search in relational databases in an incremental way. At the end of the query evaluation, a snapshot of the process is taken and stored. The snapshot can be used to restart the process after the database is updated. Our method can be used to settle the problem of answering continual keyword search in a database that is updated frequently.