Abstract
Using query logs to enhance user experience has been extensively studied in the Web IR literature. However, in the area of keyword search on structured data (relational databases in particular), most existing work has focused on improving search result quality through designing better scoring functions, without giving explicit consideration to query logs. Our work presented in this paper taps into the wealth of information contained in query logs, and aims to enhance the search effectiveness by explicitly taking into account the log information when ranking the query results. To concretize our discussion, we focus on schema-graph-based approaches to keyword search (using the seminal work DISCOVER as an example), which usually proceed in two stages, candidate network (CN) generation and CN evaluation. We propose a query-log-aware ranking strategy that uses the frequent patterns mined from query logs to help rank the CNs generated during the first stage. Given the frequent patterns, we show how to compute the maximal score of a CN using a dynamic programming algorithm. We prove that the problem of finding the maximal score is NP-hard. User studies on a real dataset validate the effectiveness of the proposed ranking strategy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hristidis, V., Papakonstantinou, Y.: DISCOVER: keyword search in relational databases. In: VLDB (2002)
Luo, Y., Lin, X., Wang, W., Zhou, X.: SPARK: top-k keyword query in relational databases. In: SIGMOD, pp. 115–126 (2007)
Hulgeri, A., Nakhe, C.: Keyword searching and browsing in databases using banks. In: ICDE (2002)
He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305–316 (2007)
Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: VLDB, pp. 850–861 (2003)
Liu, F., Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: SIGMOD, pp. 563–574 (2006)
Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: a system for keyword-based search over relational databases. In: ICDE (2002)
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)
Yu, X., Shi, H.: CI-Rank: ranking keyword search results based on collective importance. In: ICDE (2012)
Ganti, V., He, Y., Xin, D.: Keyword++: A framework to improve keyword search over entity databases. VLDB 3(1–2), 711–722 (2010)
Markowetz, A., Yang, Y., Papadias, D.: Keyword search on relational data streams. In: SIGMOD (2007)
Gao, L., Yu, X., Liu, Y.: Keyword query cleaning with query logs. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds.) WAIM 2011. LNCS, vol. 6897, pp. 31–42. Springer, Heidelberg (2011)
Peng, Z., Zhang, J., Wang, S., Wang, C.: Bring user feedback into keyword search over databases. In: Proc. of the 3rd Workshop on Electronic Government Technology and Application, pp. 210–214 (2009)
Zeng, Z., Bao, Z., Ling, T.W., Lee, M.L.: iSearch: an interpretation based framework for keyword search in relational databases. In: KEYS, pp. 3–10 (2012)
Chi, Y., Yang, Y., Muntz, R.: Indexing and mining frequent subtrees. In: ICDE (2003)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhou, J., Liu, Y., Yu, Z. (2015). Improving the Effectiveness of Keyword Search in Databases Using Query Logs. In: Dong, X., Yu, X., Li, J., Sun, Y. (eds) Web-Age Information Management. WAIM 2015. Lecture Notes in Computer Science(), vol 9098. Springer, Cham. https://doi.org/10.1007/978-3-319-21042-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-21042-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21041-4
Online ISBN: 978-3-319-21042-1
eBook Packages: Computer ScienceComputer Science (R0)