Skip to main content
Springer Nature Link
Log in

Datalog+/-: A Family of Languages for Ontology Querying

  • Conference paper
Datalog Reloaded (Datalog 2.0 2010)

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

Included in the following conference series:

Abstract

In ontology-based data access, an extensional database is enhanced by an ontology that generates new intensional knowledge which has to be considered when answering queries. In this setting, tractable data complexity (i.e., complexity w.r.t. the data only) of query answering is crucial, given the need to deal with large data sets. This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying. Plain Datalog is extended by allowing existential quantifiers, the equality predicate, and the truth constant false to appear in rule heads. At the same time, the resulting language is syntactically restricted, so as to achieve decidability and even tractability.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

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

    MATH  Google Scholar 

  2. Alvaro, P., Marczak, W., Conway, N., Hellerstein, J.M., Maier, D., Sears, R.C.: Towards scalable architectures for clickstream data warehousing. Technical report, EECS Department, University of California, Berkeley (2009)

    Google Scholar 

  3. Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of predicate logic. J. Philosophical Logic 27, 217–274 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  5. Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proc. of IJCAI, pp. 677–682 (2009)

    Google Scholar 

  6. Bárány, V., Gottlob, G., Otto, M.: Querying the guarded fragment. In: Proc. of LICS, pp. 1–10 (2010)

    Google Scholar 

  7. Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with Lixto. In: Proc. of VLDB, pp. 119–128 (2001)

    Google Scholar 

  8. Baumgartner, R., Gatterbauer, W., Gottlob, G.: Monadic Datalog and the expressive power of web information extraction languages. In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 3465–3471. Springer-Verlag New York, Inc., New York (2009)

    Google Scholar 

  9. Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Proc. of ICALP, pp. 73–85 (1981)

    Google Scholar 

  10. Brickley, D., Guha, R.V.: RDF vocabulary description language 1.0: RDF Schema. W3C Recommendation (2004), http://www.w3.org/TR/2004/REC-rdf-schema-20040210/

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

  12. Calì, A., Gottlob, G., Lukasiewicz, T.: Datalog±: A unified approach to ontologies and integrity constraints. In: Proc. of ICDT, pp. 14–30 (2009)

    Google Scholar 

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

  14. Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. Technical Report RR-10-21, Computing Laboratory, University of Oxford (2010)

    Google Scholar 

  15. Calì, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In: Proc. of LICS, pp. 228–242 (2010)

    Google Scholar 

  16. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. Proc. of VLDB 3(1), 554–565 (2010)

    Article  Google Scholar 

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

  18. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260–271 (2003)

    Google Scholar 

  19. Calvanese, D.: Finite model reasoning in description logics. In: Proc. of KR, pp. 292–303 (1996)

    Google Scholar 

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

  21. Casanova, M.A., Fagin, R., Papadimitriou, C.H.: Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci. 28, 29–59 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  22. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOC, pp. 77–90 (1977)

    Google Scholar 

  23. Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies. SIAM J. Comput. 14, 671–677 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  24. de Bruijn, J., Heymans, S.: Logical foundations of (e)RDF(S): Complexity and reasoning. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 86–99. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Google Scholar 

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

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

  28. Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1), 174–210 (2005)

    Article  MATH  Google Scholar 

  29. Gottlob, G., Koch, C.: Monadic Datalog and the expressive power of web information extraction languages. J. ACM 51(1), 71–113 (2004)

    Article  MATH  Google Scholar 

  30. Gottlob, G., Papadimitriou, C.H.: On the complexity of single-rule Datalog queries. Inf. and Comput. 183(1), 104–122 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  31. Hajiyev, E., Verbaere, M., de Moor, O.: codeQuest: scalable source code queries with datalog. In: Hu, Q. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 2–27. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

  33. Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. Inf. and Comput. 199(1-2), 132–171 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  35. Marnette, B.: Generalized schema-mappings: From termination to tractability. In: Proc. of PODS, pp. 13–22 (2009)

    Google Scholar 

  36. Patel-Schneider, P.F., Horrocks, I.: A comparison of two modelling paradigms in the semantic web. J. Web Semantics 5(4), 240–250 (2007)

    Article  Google Scholar 

  37. Rosati, R.: Finite model reasoning in dl-lite. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol. 5021, pp. 215–229. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  38. Rosati, R.: On the finite controllability of conjunctive query answering in databases under open-world assumption. Journal of Computer and System Sciences (2010) (to appear)

    Google Scholar 

  39. Vardi, M.Y.: Personal communication reported in [32] (1984)

    Google Scholar 

  40. 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. Computing Laboratory, University of Oxford, UK

    Georg Gottlob, Thomas Lukasiewicz & Andreas Pieris

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

    Andrea Calì & Georg Gottlob

  3. Department of Computer Science, University of London, Birkbeck College, UK

    Andrea Calì

Authors
  1. Andrea Calì
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Gottlob
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Lukasiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Pieris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Oege de Moor

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

    Georg Gottlob , Tim Furche  & Andrew Sellers ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calì, A., Gottlob, G., Lukasiewicz, T., Pieris, A. (2011). Datalog+/-: A Family of Languages for Ontology Querying. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds) Datalog Reloaded. Datalog 2.0 2010. Lecture Notes in Computer Science, vol 6702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24206-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24206-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics