Advertisement

Integrity and recursion: two key issues for deductive databases

  • Rainer Manthey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 474)

Abstract

In this paper we have tried to outline some of the main problems and some of the key results in two areas of research in deductive databases: integrity constraint handling and recursive query evaluation. Each of these topics has received strong attention in the research community up till now. In spite of a large amount of contributions published, the relevance of the problems addressed and solutions proposed has not yet been acknowledged accordingly. This might be due to the fact that most contributions are hard to read and understand as a consequence of their heavily formal style. By giving a presentation which is consciously a very informal one, we hope to reach a wider audience. In particular we aim at non-specialists in the AI as well as in the DB community, who might become interested in deductive database research once they have had the opportunity to enter the field without too high initial barriers.

Keywords

Logic Programming Integrity Constraint Query Evaluation Deductive Database Query Answering 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB82]
    P. Bernstein and B. Blaustein, ”Fast methods for testing quantified relational calculus assertions”, in: Proc. 8th ACM-SIGMOD Conf. on Management of Data, Orlando, 1982Google Scholar
  2. [BDM88]
    F. Bry, H. Decker, and R. Manthey, ”A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases”, in: Proc. 1st Intern. Conf. on Extending Database Technology (EDBT), Venice, 1988Google Scholar
  3. [BM86]
    M. Brodie and J. Mylopoulos [eds.], ”On Knowledge Base Management Systems”, Springer, 1986Google Scholar
  4. [BMSU86]
    F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman, ”Magic sets and other strange ways to implement logic programs”, in: Proc. 5th ACM Symp. on Principles of Database Systems (PODS), 1986Google Scholar
  5. [Boc89]
    J. Bocca et.al., ”KB-Prolog: A Prolog for very large knowledge bases”, in: Proc. 7th British National Conf. on Databases (BNCOD), 1989Google Scholar
  6. [BR87]
    C. Beeri and R. Ramakrishnan, ”On the power of magic”, in: Proc. 6th ACM Symp. on Principles of Database Systems (PODS), 1987Google Scholar
  7. [Bry89]
    F. Bry, ”Query evaluation in recursive databases: bottom-up and top-down reconciled”, in: Proc. 1st Intern. Conf. on Deductive and Object-Oriented Databases (DOOD), Kyoto, Dec. 1989 (also in: Data and Knowledge Engineering, Vol. 5, No. 4, Oct. 1990, pp. 289–312)Google Scholar
  8. [CD88]
    F. Cuppens and R. Demolombe, ”Cooperative answering: a methodology to provide intelligent access to databases”, in: Proc. 2nd Intern. Conf. on Expert Databases (EDS), Tysons Corner, 1988Google Scholar
  9. [CGM88]
    U. Chakravarthy, J. Grant, and J. Minker, ”Foundations of semantic query optimization for deductive databases”, in: [Min88a]Google Scholar
  10. [CGT90]
    S. Ceri, G, Gottlob, and L. Tanca, ”Logic programming and databases”, Springer, 1990Google Scholar
  11. [Dec84]
    H. Decker, ”Integrity enforcement on deductive databases”, in: Proc. 1st Intern. Conf. on Expert Database Systems (EDS), Charleston, 1986Google Scholar
  12. [Die87]
    S.W. Dietrich, ”Extension tables: memo relations in logic programming”, in: Proc. Symp. on Logic Programming (SLP), San Francisco, 1987Google Scholar
  13. [GMN84]
    H. Gallaire, J. Minker, and J.-M. Nicolas, ”Logic and databases: a deductive approach”, ACM Computing Surveys, Vol. 16, No. 2, 1984Google Scholar
  14. [Imi87]
    T. Imielinski, ”Intelligent query answering in rule based systems”, Journal of Logic Programming, Vol. 4, No. 2, 1987Google Scholar
  15. [KSS87]
    R. Kowalski, F. Sadri, and P. Soper, ”Integrity checking in deductive databases”, in: Proc. 13th Intern. Conf. on Very Large Databases (VLDB), Brighton, 1987Google Scholar
  16. [Lip88]
    U. Lipeck, ”Transformation of dynamic integrity constraints into transaction specifications”, in: Proc. 2nd Intern. Conf. on Database Theory (ICDT), Bruges, 1988 (also in: Theoretical Computer Science, Vol. 76, No. 1, 1990)Google Scholar
  17. [LiS87]
    U. Lipeck and G. Saake, ”Monitoring dynamic integrity constraints based on temporal logic”, Information Systems, Vol. 12, 1987Google Scholar
  18. [LST87]
    J. Lloyd, E. Sonenberg, and R. Topor, ”Integrity constraint checking in stratified databases”, Journal of Logic Programming, Vol. 4, No. 4, 1987Google Scholar
  19. [LV89]
    A. Lefebvre and L. Vieille, ”On deductive query evaluation in the Dedgin* system”, in: Proc. 1st Intern. Conf. on Deductive and Object-Oriented Databases (DOOD), Kyoto, Dec. 1989Google Scholar
  20. [Man90]
    R. Manthey, ”Satisfiability of integrity constraints: Reflections on a neglected problem”, in: Proc. 2nd Intern. Workshop on Foundations of Models and Languages for Data and Objects, Aigen, 1990 (available from TU Clausthal)Google Scholar
  21. [MB88]
    R. Manthey and F. Bry, ”SATCHMO: A theorem prover implemented in Prolog”, in: Proc. 9th Intern. Conf. on Automated Deduction (CADE), Chicago, 1988Google Scholar
  22. [MH89]
    W. McCune and L. Henschen, ”Maintaining state constraints in relational databases: A proof theoretic basis”, Journal of the ACM, Vol. 36, No. 1, 1989Google Scholar
  23. [Min88a]
    J. Minker [ed.], ”Foundations of deductive databases and logic programming”, Morgan Kaufmann, 1988Google Scholar
  24. [Min88b]
    J. Minker, ”Perspectives in deductive databases”, Journal of Logic Programming, Vol. 5, No. 1, 1988Google Scholar
  25. [Mot89]
    A. Motro, ”Using integrity constraints to provide intensional answers to relational queries”, in: Proc. 15th Intern. Conf. on Very Large Databases (VLDB), Amsterdam, 1989Google Scholar
  26. [Nej87]
    W. Nejdl, ”Recursive strategies for answering recursive queries — the RQA/FQI strategy”, in: Proc. 13th Intern. Conf. on Very Large Databases (VLDB), Brighton, 1987Google Scholar
  27. [Nic82]
    J.-M. Nicolas, ”Logic for improving integrity checking in relational databases”, Acta Informatica, Vol. 18, No. 3, 1982Google Scholar
  28. [PR89]
    A. Pirotte and D. Roelants, ”Constraints for improving the generation of intensional answers in a deductive database”, in: Proc. 5th IEEE Intern. Conf. on Data Engineering, Los Angeles, 1989Google Scholar
  29. [RLK86]
    J. Rohmer, R. Lescoeur, and J.-M. Kerisit, ”The Alexander method: A technique for the processing of recursive axioms in deductive databases”, New Generation Computing, Vol. 4, No. 3, 1986Google Scholar
  30. [SM88]
    C.-D. Shum, R. Muntz, ”Implicit representation of extensional answers”, in: Proc. 2nd Intern. Conf. on Expert Database Systems (EDS), Tysons Corner, 1988Google Scholar
  31. [SO87]
    S. Shenoy and Z. Oszoyoglu, ”A system for semantic query optimization”, in: Proc. 13th ACM-SIGMOD Conf. on Management of Data, San Francisco, 1987Google Scholar
  32. [ST89]
    J. Schmidt and C. Thanos [eds.], ”Foundations of Knowledge Base Management”, Springer, 1989Google Scholar
  33. [TS86]
    H. Tamaki and T. Sato, ”OLD resolution with tabulation”, in: Proc. 3rd Intern. Conf. on Logic Programming (ICLP), London, 1986Google Scholar
  34. [Ull89a]
    J. Ullman, ”Principles of database and knowledge base systems”, Vol. 2, Computer Science Press, 1989Google Scholar
  35. [Ull89b]
    J. Ullman, ”Bottom-up beats top-down for Datalog”, in: Proc. 8th ACM Symp. on Principles of Database Systems (PODS), Philadelphia, 1989Google Scholar
  36. [vEK76]
    M. van Emden and R. Kowalski, ”The semantics of predicate logic as a programming language”, Journal of the ACM, Vol. 23, No. 4, 1976Google Scholar
  37. [Vie86]
    L. Vieille, ”Recursive axioms in deductive databases: The Query-Subquery approach”, in: Proc. 1st Intern. Conf. on Expert Database Systems (EDS), Charleston, 1986Google Scholar
  38. [Vie89]
    L. Vieille, ”Recursive query processing: The power of logic”, Theoretical Computer Science, Vol. 69, No.1, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Rainer Manthey
    • 1
  1. 1.European Computer-Industry Research Centre (ECRC)München 81Germany

Personalised recommendations