Improving the Effectiveness of Keyword Search in Databases Using Query Logs

  • Jing Zhou
  • Yang LiuEmail author
  • Ziqiang Yu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9098)


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.


Relational Database Frequent Pattern User Preference Keyword Search Query Result 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hristidis, V., Papakonstantinou, Y.: DISCOVER: keyword search in relational databases. In: VLDB (2002)Google Scholar
  2. 2.
    Luo, Y., Lin, X., Wang, W., Zhou, X.: SPARK: top-k keyword query in relational databases. In: SIGMOD, pp. 115–126 (2007)Google Scholar
  3. 3.
    Hulgeri, A., Nakhe, C.: Keyword searching and browsing in databases using banks. In: ICDE (2002)Google Scholar
  4. 4.
    He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305–316 (2007)Google Scholar
  5. 5.
    Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: VLDB, pp. 850–861 (2003)Google Scholar
  6. 6.
    Liu, F., Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: SIGMOD, pp. 563–574 (2006)Google Scholar
  7. 7.
    Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: a system for keyword-based search over relational databases. In: ICDE (2002)Google Scholar
  8. 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. 9.
    Yu, X., Shi, H.: CI-Rank: ranking keyword search results based on collective importance. In: ICDE (2012)Google Scholar
  10. 10.
    Ganti, V., He, Y., Xin, D.: Keyword++: A framework to improve keyword search over entity databases. VLDB 3(1–2), 711–722 (2010)Google Scholar
  11. 11.
    Markowetz, A., Yang, Y., Papadias, D.: Keyword search on relational data streams. In: SIGMOD (2007)Google Scholar
  12. 12.
    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) CrossRefGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    Chi, Y., Yang, Y., Muntz, R.: Indexing and mining frequent subtrees. In: ICDE (2003)Google Scholar
  16. 16.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Computer Science & TechnologyShandong UniversityJinanChina

Personalised recommendations