Skip to main content
SpringerLink
Log in

Processing Keyword Queries Under Access Limitations

  • Conference paper
  • First Online:
Semantic Keyword-Based Search on Structured Data Sources (IKC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9398))

  • 454 Accesses

Abstract

The Deep Web is constituted by data accessible through web pages, but not readily indexable by search engines, as they are returned in dynamic pages. In this paper we propose a framework for accessing Deep Web sources, represented as relational tables with so-called access limitations, with keyword-based queries. We formalize the notion of optimal answer and investigate methods for query processing. We also outline the main ideas of our implementation of a prototype system for Deep Web keyword search.

A preliminary version of this paper was published in the 9th Alberto Mendelzon Workshop on Foundations of Data Management, 2015, http://ceur-ws.org/Vol-1378.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Notes

  1. 1.

    http://thomaswlynch.com/liquid/liquid-doc/liquid/doc/liquid/index.html.

References

  1. Torlone, R.: Towards a new foundation for keyword search in relational databases. In: AMW (2014)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. Calì, A., Martinenghi, D.: Querying data under access limitations. In: ICDE, pp. 50–59 (2008)

    Google Scholar 

  4. Li, C., Chang, E.Y.: Answering queries with useful bindings. ACM Trans. Database Syst. 26(3), 313–343 (2001)

    Article  Google Scholar 

  5. Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In: PODS, pp. 173–182 (2006)

    Google Scholar 

  6. Vardi, M.: The complexity of relational query languages. In: STOC, pp. 137–146 (1982)

    Google Scholar 

  7. Xu Yu, J., Qin, L., Chang, L.: Search in relational databases: a survey. IEEE Data Eng. Bull. 33(1), 67–78 (2010)

    Google Scholar 

Download references

Acknowledgments

Andrea Calì and Thomas Lynch acknowledge support by the EPSRC grant “Logic-based Integration and Querying of Unindexed Data” (EP/E010865/1).

Author information

Authors and Affiliations

  1. University of London, Birkbeck, UK

    Andrea Calì & Thomas W. Lynch

  2. Politecnico di Milano, Milano, Italy

    Davide Martinenghi

  3. Università Roma Tre, Rome, Italy

    Riccardo Torlone

  4. Oxford-Man Institute of Quantitative Finance, University of Oxford, Oxford, UK

    Andrea Calì

  5. Reasoning Technology Ltd, London, UK

    Thomas W. Lynch

  6. Birkbeck University of London, London, UK

    Thomas W. Lynch

Authors
  1. Andrea Calì
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas W. Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Davide Martinenghi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Riccardo Torlone
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Calì .

Editor information

Editors and Affiliations

  1. University of Coimbra, Coimbra, Portugal

    Jorge Cardoso

  2. Huawei European Research Center, Munich, Germany

    Jorge Cardoso

  3. Dipartimento di Ingegneria “Enzo Ferrari”, Università di Modena e Reggio Emilia, Modena, Italy

    Francesco Guerra

  4. Delft University of Technology, Delft, Zuid-Holland, The Netherlands

    Geert-Jan Houben

  5. University of Coimbra, Coimbra, Portugal

    Alexandre Miguel Pinto

  6. Università degli Studi di Trento, Trento, Italy

    Yannis Velegrakis

Rights and permissions

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Calì, A., Lynch, T.W., Martinenghi, D., Torlone, R. (2015). Processing Keyword Queries Under Access Limitations. In: Cardoso, J., Guerra, F., Houben, GJ., Pinto, A.M., Velegrakis, Y. (eds) Semantic Keyword-Based Search on Structured Data Sources. IKC 2015. Lecture Notes in Computer Science(), vol 9398. Springer, Cham. https://doi.org/10.1007/978-3-319-27932-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27932-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27931-2

  • Online ISBN: 978-3-319-27932-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation