Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Ontological Query Answering via Rewriting

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2011)

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

Abstract

Ontological databases extend traditional databases with ontological constraints. This technology is crucial for many applications such as semantic data publishing and integration as well as model-driven database design. For many classes of ontological constraints, query answering can be solved via query rewriting. In particular, given a conjunctive query and a set of ontological constraints, the query is compiled into a first-order query, called the perfect rewriting, that encodes the intensional knowledge implied by the constraints. Then, for every database D, the answer is obtained by directly evaluating the perfect rewriting over D. Since first-order queries can be easily translated into SQL, ontological query answering can be delegated to traditional DBMSs. This allows us to utilize all the query optimization techniques available in the underlying DBMS. This paper surveys current approaches to rewriting-based query answering of ontological databases.

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Ajtai, M., Gurevich, Y.: Datalog vs. first-order logic. In: Proc. of FOCS, pp. 142–147 (1989)

    Google Scholar 

  3. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  4. Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artif. Intell. 175(9-10), 1620–1654 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  6. Bishop, B., Kiryakov, A., Ognyanoff, D., Peikov, I., Tashev, Z., Velkov, R.: Owlim: A family of scalable semantic repositories. Semantic Web 2(1), 33–42 (2011)

    Google Scholar 

  7. Cabibbo, L.: The expressive power of stratified logic programs with value invention. Inf. Comput. 147(1), 22–56 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70–80 (2008)

    Google Scholar 

  9. Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77–86 (2009)

    Google Scholar 

  10. Calì, A., Gottlob, G., Pieris, A.: Tractable query answering over conceptual schemata. In: Laender, A.H.F., Castano, S., Dayal, U., Casati, F., de Oliveira, J.P.M. (eds.) ER 2009. LNCS, vol. 5829, pp. 175–190. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554–565 (2010)

    Google Scholar 

  12. Calì, A., Gottlob, G., Pieris, A.: Query answering under expressive Entity-Relationship schemata. In: Parsons, J., Saeki, M., Shoval, P., Woo, C., Wand, Y. (eds.) ER 2010. LNCS, vol. 6412, pp. 347–361. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Calì, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in Datalog±. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 1–17. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Proc. AMW (2010)

    Google Scholar 

  15. Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI, pp. 16–21 (2003)

    Google Scholar 

  16. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3), 385–429 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of KR, pp. 260–270 (2006)

    Google Scholar 

  18. Chong, E., Das, S., Eadon, G., Srinivasan, J.: An efficient SQL-based RDF querying scheme. In: Proc. of the 31th Intl Conf. on Very Large Data Bases (VLDB), pp. 1216–1227 (2005)

    Google Scholar 

  19. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisisted. In: Proc. of PODS, pp. 149–158 (2008)

    Google Scholar 

  20. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gaifman, H., Mairson, H.G., Sagiv, Y., Vardi, M.Y.: Undecidable optimization problems for database logic programs. J. ACM 40(3), 683–713 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  22. Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: Proc. of ICDE, pp. 2–13 (2011)

    Google Scholar 

  23. Gottlob, G., Schwentick, T.: Rewriting ontological queries into small non-recursive Datalog programs. In: Proc. of DL (2011)

    Google Scholar 

  24. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167–189 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  25. Joiner, W.H.: Resolution strategies as decision procedures. J. ACM 23, 398–417 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Proc. of KR (2010)

    Google Scholar 

  27. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)

    Article  Google Scholar 

  28. Orsi, G., Pieris, A.: Optimizing query answering under ontological constraints. In: PVLDB (2011) (in press)

    Google Scholar 

  29. Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  30. Pérez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. Journal of Applied Logic 8(2), 151–232 (2009)

    MathSciNet  MATH  Google Scholar 

  31. Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: Proc. KR (2010)

    Google Scholar 

  32. Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. of PODS, pp. 266–276 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oxford, UK

    Georg Gottlob & Andreas Pieris

  2. Institute for the Future of Computing, University of Oxford, UK

    Giorgio Orsi

Authors
  1. Georg Gottlob
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Orsi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Pieris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Alpen Adria Universität Klagenfurt, Institut für Informatik-Systeme, Universitätsstr. 65, 9020, Klagenfurt, Austria

    Johann Eder

  2. Faculty of Informatics and Information Technologies, Slovak University of Technology in Bratislava, Ilkoviçova 3, 842 16, Bratislava, Slovakia

    Maria Bielikova

  3. Institut für Softwaretechnik, Technische Universität Wien, Favoritenstr. 9-11/188, 1040, Wien, Austria

    A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gottlob, G., Orsi, G., Pieris, A. (2011). Ontological Query Answering via Rewriting. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds) Advances in Databases and Information Systems. ADBIS 2011. Lecture Notes in Computer Science, vol 6909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23737-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23737-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23736-2

  • Online ISBN: 978-3-642-23737-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation