Skip to main content
SpringerLink
Log in

Understanding the Semantics of Keyword Queries on Relational Data Without Accessing the Instance

  • Chapter
  • First Online:
Semantic Search over the Web

Part of the book series: Data-Centric Systems and Applications ((DCSA))

  • 1349 Accesses

Abstract

The simplicity of keyword queries has made them particularly attractive to the technically unskilled user base, tending to become the de facto standard for querying on the web. Unfortunatelly, alongside its simplicity, came also the loose semantics. Researchers have, for a long time, studied ways to understand the keyword query semantics and retrieve the most relevant data artifacts. For the web, these artifacts were documents; thus, any semantics discovering effort was based mainly on statistics about the appearance of the keywords in the documents. Recently, there has been an increasing interest in publishing structural data on the web, allowing users to exploit valuable resources that have so far been kept private within companies and organizations. These sources support only structural queries. If they are to become available on the web and be queried, the queries will be in the form of keywords and they will have to be translated into structured queries in order to be executed. Existing works have exploited the instance data in order to build off-line an index that is used at query time to drive the translation. This idea is not always possible to implement since the owner of the data source is typically not willing to allow unrestricted access to the data or to offer resources for the index construction. This chapter elaborates on methods of discovering the semantics of keyword queries without requiring access to the instance data. It describes methods that exploit metainformation about the source data and the query in order to find semantic matches between the keywords and the database structures. These matches form the basis for translating the keyword query into a structure query.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://www.w3.org/standards/semanticweb/

  2. 2.

    Since a configuration is a function, we use the term image to refer to its output.

  3. 3.

    http://www.ontologyportal.org

  4. 4.

    http://wordnet.princeton.edu

References

  1. Aditya, B., Bhalotia, G., Chakrabarti, S., Hulgeri, A., Nakhe, C., Parag, Sudarshan, S.: Banks: browsing and keyword searching in relational databases. VLDB, pp. 1083–1086. Morgan Kaufmann, New York (2002)

    Google Scholar 

  2. Agrawal, S., Chaudhuri, S., Das, G.: Dbxplorer: a system for keyword-based search over relational databases. ICDE, pp. 5–16. IEEE Computer Society, Silver Spring, MD (2002)

    Google Scholar 

  3. Alpaydin, E.: Introduction to Machine Learning, 2nd edn. MIT, Cambridge, MA (2010)

    Google Scholar 

  4. Bergamaschi, S., Bouquet, P., Giacomuzzi, D., Guerra, F., Po, L., Vincini, M.: An incremental method for the lexical annotation of domain ontologies. Int. J. Semant. Web Inf. Syst. 3(3), 57–80 (2007)

    Article  Google Scholar 

  5. Bergamaschi, S., Domnori, E., Guerra, F., Lado, R.T., Velegrakis, Y.: Keyword search over relational databases: a metadata approach. In: Sellis T.K., Miller R.J., Kementsietsidis A., Velegrakis Y. (eds.) SIGMOD Conference, pp. 565–576. ACM, New York (2011)

    Google Scholar 

  6. Bergamaschi, S., Domnori, E., Guerra, F., Orsini, M., Lado, R.T., Velegrakis, Y.: Keymantic: semantic keyword-based searching in data integration systems. PVLDB 3(2), 1637–1640 (2010)

    Google Scholar 

  7. Bergamaschi, S., Guerra, F., Rota, S., Velegrakis, Y.: A hidden markov model approach to keyword-based search over relational databases. In: to appear in ER. Springer (LNCS) (2011)

    Google Scholar 

  8. Bergamaschi, S., Sartori, C., Guerra, F., Orsini, M.: Extracting relevant attribute values for improved search. IEEE Inter. Comput. 11(5), 26–35 (2007)

    Article  Google Scholar 

  9. Bergman, M.K.: The deep web: surfacing hidden value. J. Electron. Publ. 7(1) (2001). URL http://dx.doi.org/10.3998/3336451.0007.104

  10. Bleiholder, J., Naumann, F.: Data fusion. ACM Comput. Surv. 41(1) (2008)

    Google Scholar 

  11. Bourgeois, F., Lassalle, J.C.: An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Commun. ACM 14(12), 802–804 (1971)

    Article  MathSciNet  Google Scholar 

  12. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Networks 30(1–7), 107–117 (1998)

    Google Scholar 

  13. Burkard, R., Dell’Amico, M., Martello, S.: Assignment problems. SIAM society for industrial and applied mathematics, Philadelphia (2009)

    Google Scholar 

  14. Chakrabarti, S., Sarawagi, S., Sudarshan, S.: Enhancing search with structure. IEEE Data Eng. Bull. 33(1), 3–24 (2010)

    Google Scholar 

  15. Cilibrasi, R., Vitányi, P.M.B.: The google similarity distance. IEEE Trans. Knowl. Data Eng. 19(3), 370–383 (2007)

    Article  Google Scholar 

  16. Cohen, W.W., Ravikumar, P.D., Fienberg, S.E.: A comparison of string distance metrics for name-matching tasks. IIWeb, pp. 73–78 (2003)

    Google Scholar 

  17. Florescu, D., Kossmann, D., Manolescu, I.: Integrating keyword search into xml query processing. BDA (2000)

    Google Scholar 

  18. Haofen, W., Kang Zhang, Q.L., Tran, D.T., Yu, Y.: Q2semantic: a lightweight keyword interface to semantic search. Proceedings of the 5th European Semantic Web Conference, LNCS, pp. 584–598. Tenerife, Spain (2008)

    Google Scholar 

  19. Hristidis, V., Papakonstantinou, Y.: Discover: keyword search in relational databases. VLDB, pp. 670–681 (2002)

    Google Scholar 

  20. Konstanz, U., Roder, M., Hamzaoui, R.: Fast list viterbi decoding and application for source-channel coding of images. Konstanzer schriften in mathematik und informatik, http://www.inf.uni-konstanz.de/Preprints/preprints-all.html, pp. 801–804 (2002)

  21. Kotidis, Y., Marian, A., Srivastava, D.: Circumventing data quality problems using multiple join paths. CleanDB (2006)

    Google Scholar 

  22. Kumar, R., Tomkins, A.: A characterization of online search behavior. IEEE Data Eng. Bull. 32(2), 3–11 (2009)

    Google Scholar 

  23. Lam, T.Y., Meyer, I.M.: Efficient algorithms for training the parameters of hidden markov models using stochastic expectation maximization (em) training and viterbi training. Algorithms Mol. Biol. 5(38) (2010). DOI 10.1186/1748-7188-5-38

    Google Scholar 

  24. Lember, J., Koloydenko, A.: Adjusted viterbi training. Probab. Eng. Inf. Sci. 21, 451–475 (2007). DOI 10.1017/S0269964807000083. URL http://portal.acm.org/citation.cfm?id=1291117.1291125

  25. Li, L., Shang, Y., Shi, H., Zhang, W.: Performance evaluation of hits-based algorithms. Communications, internet, and information technology, pp. 171–176 (2002)

    Google Scholar 

  26. Li, Y., Yu, C., Jagadish, H.V.: Schema-free XQuery. VLDB, pp. 72–83 (2004)

    Google Scholar 

  27. Liu, F., Yu, C.T., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. SIGMOD, pp. 563–574. ACM, New York (2006)

    Google Scholar 

  28. Madhavan, J., Ko, D., Kot, L., Ganapathy, V., Rasmussen, A., Halevy, A.: Google’s deep web crawl. Proc. Very Large Databases (VLDB) Endow. 1(2), 1241–1252 (2008). DOI http://portal.acm.org/citation.cfm?id=1454163

  29. Maier, D., Ullman, J.D., Vardi, M.Y.: On the foundations of the universal relation model. ACM Trans. Database Syst. 9(2), 283–308 (1984)

    Article  MathSciNet  Google Scholar 

  30. Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. ICDE, pp. 117–128. IEEE Computer Society, Silver Spring, MD (2002)

    Google Scholar 

  31. Mena, E.: OBSERVER: an approach for query processing in global information systems based on interoperation across pre-exisiting ontologies, University of Zaragoza, 1998

    Google Scholar 

  32. Nandi, A., Jagadish, H.V.: Assisted querying using instant-response interfaces. SIGMOD, pp. 1156–1158. ACM, New York (2007)

    Google Scholar 

  33. Popa, L., Velegrakis, Y., Miller, R.J., Hernandez, M.A., Fagin, R.: Translating web data. VLDB, pp. 598–609 (2002)

    Google Scholar 

  34. Pound, J., Paparizos, S., Tsaparas, P.: Facet discovery for structured web search: a query-log mining approach. SIGMOD conference, pp. 169–180. ACM, New York (2011)

    Google Scholar 

  35. Pu, K.Q.: Keyword query cleaning using hidden markov models. In: Özsu, M.T., Chen, Y., 0002, L.C. (eds.) KEYS, pp. 27–32. ACM, New York (2009)

    Google Scholar 

  36. Qin, L., Yu, J.X., Chang, L.: Keyword search in databases: the power of rdbms. SIGMOD, pp. 681–694. ACM, New York (2009)

    Google Scholar 

  37. Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB J. 10(4), 334–350 (2001)

    Article  Google Scholar 

  38. Seshadri, N., Sundberg, C.E.: List Viterbi decoding algorithms with applications. IEEE Trans. Commun. 42(234), 313–323 (1994). DOI 10.1109/TCOMM.1994.577040

    Article  Google Scholar 

  39. Simitsis, A., Koutrika, G., Ioannidis, Y.E.: Précis: from unstructured keywords as queries to structured databases as answers. VLDB J. 17(1), 117–149 (2008)

    Article  Google Scholar 

  40. Singhal, A., Buckley, C., Mitra, M.: Pivoted document length normalization. SIGIR, pp. 21–29 (1996)

    Google Scholar 

  41. Tata, S., Lohman, G.M.: Sqak: doing more with keywords. In: Wang J.T.L. (ed.) Proceedings of the ACM SIGMOD International Conference on Management of data, SIGMOD 2008, Vancouver, BC, Canada, pp. 889–902. ACM, New York (2008)

    Google Scholar 

  42. Tata, S., Lohman, G.M.: SQAK: doing more with keywords. SIGMOD, pp. 889–902. ACM, New York (2008)

    Google Scholar 

  43. Theobald, M., Bast, H., Majumdar, D., Schenkel, R., Weikum, G.: TopX: efficient and versatile top-k query processing for semistructured data. VLDB J. 17(1), 81–115 (2008)

    Article  Google Scholar 

  44. Tran, T., Mathäß, T., Haase, P.: Usability of keyword-driven schema-agnostic search. 7th extended semantic web conference (ESWC’10), Greece. Springer, Berlin, Heidelberg, New York (2010)

    Google Scholar 

  45. Tran, T., Wang, H., Rudolph, S., Cimiano, P.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data. ICDE, pp. 405–416. IEEE Computer Society, Silver Spring, MD (2009). DOI http://dx.doi.org/10.1109/ICDE. 2009.119

  46. Trillo, R., Gracia, J., Espinoza, M., Mena, E.: Discovering the semantics of user keywords. J. UCS 13(12) (2007)

    Google Scholar 

  47. Wright, A.: Searching the deep web. Commun. ACM 51, 14–15 (2008). DOI 10.1145/ 1400181.1400187

    Article  Google Scholar 

  48. Yu, J.X., Qin, L., Chang, L.: Keyword Search in Databases. Morgan and Claypool, San Francisco (2010)

    Google Scholar 

  49. Yu, J.X., Qin, L., Chang, L.: Keyword search in databases. Synthesis Lectures on Data Management. Morgan and Claypool, San Francisco (2010)

    Google Scholar 

  50. Zenz, G., Zhou, X., Minack, E., Siberski, W., Nejdl, W.: From keywords to semantic queries-incremental query construction on the semantic web. J. Web Semant. 7(3), 166–176 (2009). DOI http://dx.doi.org/10.1016/j.websem.2009.07.005

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DII-UNIMORE, via Vignolese 905, Modena, Italy

    Sonia Bergamaschi, Elton Domnori & Silvia Rota

  2. DEA-UNIMORE, v.le Berengario 51, Modena, Italy

    Francesco Guerra

  3. Informática e Ing. Sistemas, c/ María de Luna, 50018, Zaragoza, Spain

    Raquel Trillo Lado

  4. University of Trento, Trento, Italy

    Yannis Velegrakis

Authors
  1. Sonia Bergamaschi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elton Domnori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvia Rota
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesco Guerra
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Raquel Trillo Lado
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yannis Velegrakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yannis Velegrakis .

Editor information

Editors and Affiliations

  1. , Dipartimento di Informatica, Università degli Studi Roma Tre, Via della Vasca Navale 79, Roma, 00146, Italy

    Roberto De Virgilio

  2. e Reggio Emilia, Dipartimento di Economia Aziendale, Università degli Studi di Modena, Via le Berengario, 51, Modena, 41100, Italy

    Francesco Guerra

  3. Università degli Studi di Trento, Via Sommarive 14, Trento, 38123, Italy

    Yannis Velegrakis

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bergamaschi, S., Domnori, E., Rota, S., Guerra, F., Lado, R.T., Velegrakis, Y. (2012). Understanding the Semantics of Keyword Queries on Relational Data Without Accessing the Instance. In: De Virgilio, R., Guerra, F., Velegrakis, Y. (eds) Semantic Search over the Web. Data-Centric Systems and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25008-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25008-8_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25007-1

  • Online ISBN: 978-3-642-25008-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation