Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu


  • Grigoris KarvounarakisEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_968


Deductive databases


An important limitation of relational calculus/algebra is that it cannot express queries involving “paths” through an instance, such as taking the transitive closure over a binary relation. Datalog extends conjunctive queries with recursion to support such queries. A Datalog program consists of a set of rules, each of which is a conjunctive query. Recursion is introduced by allowing the same relational symbols in both the heads and the bodies of the rules. A surprising and elegant property of Datalog is that there are three very different but equivalent approaches to define its semantics, namely, the model-theoretic, proof-theoretic, and fixpoint approaches. Datalog inherits these properties from logic programming and its standard language Prolog. The main restriction that distinguishes Datalog from Prolog is that function symbols are not allowed.

Several techniques have been proposed for the efficient evaluation of Datalog programs. They are...

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

Recommended Reading

  1. 1.
    Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.zbMATHGoogle Scholar
  2. 2.
    Bidoit N. Bases de Données Déductives: Présentation de Datalog. Armand Colin; 1992.Google Scholar
  3. 3.
    Ullman JD. Principles of database and knowledge-base systems, vol. I. Reading: Addison-Wesley; 1989.Google Scholar
  4. 4.
    Ramakrishnan R, Gehrke J. Database management systems. 3rd ed. New York: McGraw-Hill; 2003.zbMATHGoogle Scholar
  5. 5.
    Lenzerini M. Tutorial – data integration: a theoretical perspective. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on principles of Database Systems; 2002.Google Scholar
  6. 6.
    Duschka O, Genesereth M, Levy A. Recursive query plans for data integration. J Log Program. 2000;43(1):49–73.CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Popa L, Velegrakis Y, Miller RJ, Hernández MA, Fagin R. Translating web data. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002.CrossRefGoogle Scholar
  8. 8.
    Green TJ, Karvounarakis G, Ives ZG, Tannen V. Update exchange with mappings and provenance. In: Proceedings of the 33rd International Conference on Very Large Data Bases; 2007.Google Scholar
  9. 9.
    Loo B.T., Condie T., Garofalakis M.N., Gay D.E., Hellerstein J.M., Maniatis P., Ramakrishnan R., Roscoe T., Stoica I. Declarative networking: language, execution and optimization. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2006. p. 97–108.Google Scholar
  10. 10.
    Green TJ, Aref M, Karvounarakis G. LogicBlox platform and language: a tutorial. In: Datalog 2.0 workshop. Vienna; 2012.Google Scholar
  11. 11.

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.LogicBloxAtlantaUSA

Section editors and affiliations

  • Val Tannen
    • 1
  1. 1.Department of Computer and Inf. ScienceUniversity of PennsylvaniaPhiladelphiaUSA