Encyclopedia of Database Systems

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

Query Processing in Deductive Databases

  • Letizia TancaEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_859


Datalog query processing and optimization; Logical query processing and optimization; Recursive query evaluation


Most of the research work on deductive databases has concerned the Datalog language, a query language based on the logic programming paradigm which was designed and intensively studied for about a decade. Its origins date back to the beginning of logic programming, but it became prominent as a separate area around 1978, when Hervé Gallaire and Jack Minker organized a workshop on logic and databases. In this entry, the definition of the typical computation styles of Datalog will be given, the most important optimization types will be summarized, and some developments will be outlined.

Historical Background

The research on deductive databases was concentrated mostly between the mid-1980s and the mid-1990s. In those years, substantial efforts were made to merge Artificial Intelligence technologies with those of the database area, with the aim of building larg...

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

Recommended Reading

  1. 1.
    Bancilhon F, Maier D, Sagiv Y, Ullman JD. Magic sets and other strange ways to implement logic programs. In: Proceedings of the 5th ACM SIGACT SIGMOD Symposium on Principles of Database Systems; 1986. p. 1–15. Available at: https://pdfs.semanticscholar.org/1289/85b85556c30ad405863f2a34340049957616.pdf
  2. 2.
    Ceri S, Gottlob G, Tanca L. Logic programming and databases. Berlin: Springer; 1990.CrossRefGoogle Scholar
  3. 3.
    Chandra AK, Harel D. Horn clauses queries and generalizations. J Log Program. 1985;2(1):1–15.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Ullman JD. Principles of database and Knowledge-Base systems. IRockville: Computer Science Press; 1988.Google Scholar
  5. 5.
    Bocca JB. EDUCE: a marriage of convenience: Prolog and a Relational DBMS. In: Proceedings of the Symposium in Logic Programming; 1986. p. 36–45.Google Scholar
  6. 6.
    Tsur S, Zaniolo C. LDL: a logic-based data language. In: Proceedings of the 12th International Conference on Very Large Data Bases; 1986. p. 33–41. Available at: https://dl.acm.org/citation.cfm?id=671478.
  7. 7.
    Abiteboul S, Hull R, Vianu V. Foundations of 510 databases. Reading: Addison-Wesley; 1995.Google Scholar
  8. 8.
    Lloyd JW. Foundations of logic programming. 2nd ed. Berlin: Springer; 1987. ISBN:3-540-18199-7.zbMATHCrossRefGoogle Scholar
  9. 9.
    Kowalski RA, Kuehner D. Linear resolution with selection function. Artif Intell. 1971;2(3–4):227–60.MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Chakravarthy US, Minker J, Grant J. Semantic query optimization: additional constraints and control strategies. In: Proceedings of the Expert Database Conference; 1986. p. 345–79.Google Scholar
  11. 11.
    Sacca D, Zaniolo C. Stable models and non-determinism in logic programs with negation. In: Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1990. p. 205–217. Available at: https://dl.acm.org/citation.cfm?id=298572.
  12. 12.
    Laenens E, Vermeir D. Assumption-free semantics for ordered logic programs: on the relationship between well-founded and stable partial models. J Log Comput. 1992;2(2):133–72.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Behrend A. Soft stratification for magic set based query evaluation in deductive databases. In: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2003. p. 102–10. Available at: https://dl.acm.org/citation.cfm?id=773164.
  14. 14.
    Comai S, Tanca L. Termination and confluence by rule prioritization. IEEE Trans Knowl Data Eng. 2003;15(2):257–70.CrossRefGoogle Scholar
  15. 15.
    W3C Member Submission. SWRL: a semantic Web rule language combining OWL and RuleML. 2004. Available at: http://www.w3.org/Submission/SWRL/
  16. 16.
    Ameloot TJ. Declarative networking: recent theoretical work on coordination, correctness, and declarative semantics. SIGMOD Rec. 2014;43(2):5–16. Available at: http://www.sigmod.org/publications/sigmod-record/1406/pdfs/03.principles.Ameloot.pdf.CrossRefGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Computer SciencePolitecnico di MilanoMilanItaly

Section editors and affiliations

  • Evaggelia Pitoura
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of IoanninaIoanninaGreece