WAIM 2010: Web-Age Information Management pp 755-767 | Cite as
Efficient Continuous Top-k Keyword Search in Relational Databases
Abstract
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword 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 maintain 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.
Keywords
Relational databases keyword search continuous queries incremental maintenancePreview
Unable to display preview. Download preview PDF.
References
- 1.Aditya, B., Bhalotia, G., Chakrabarti, S., Hulgeri, A., Nakhe, C., Parag, Sudarshan, S.: BANKS: Browsing and keyword searching in relational databases. In: VLDB, pp. 1083–1086 (2002)Google Scholar
- 2.Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: Enabling keyword search over relational databases. In: ACM SIGMOD, p. 627 (2002)Google Scholar
- 3.Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: VLDB, pp. 850–861 (2003)Google Scholar
- 4.Liu, F., Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: ACM SIGMOD, pp. 563–574 (2006)Google Scholar
- 5.Luo, Y., Lin, X., Wang, W., Zhou, X.: SPARK: Top-k keyword query in relational databases. In: ACM SIGMOD, pp. 115–126 (2007)Google Scholar
- 6.Li, G., Zhou, X., Feng, J., Wang, J.: Progressive keyword search in relational databases. In: ICDE, pp. 1183–1186 (2009)Google Scholar
- 7.Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword search in relational databases. In: VLDB, pp. 670–681 (2002)Google Scholar
- 8.Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp. 505–516 (2005)Google Scholar
- 9.He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: Ranked keyword searches on graphs. In: ACM SIGMOD, pp. 305–316. ACM, New York (2007)Google Scholar
- 10.Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: EASE: An effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: ACM SIGMOD, pp. 903–914 (2008)Google Scholar
- 11.Wang, S., Zhang, K.: Searching databases with keywords. J. Comput. Sci. Technol. 20(1), 55–62 (2005)CrossRefGoogle Scholar
- 12.Burns, A.: Preemptive priority based scheduling: An appropriate engineering approach. In: Son, S.H. (ed.) Advances in Real Time Systems, pp. 225–248. Prentice Hall, Englewood Cliffs (1994)Google Scholar