Skip to main content
SpringerLink
Log in
Book cover

Workshop on Information Systems and Artificial Intelligence

IS/KI 1990: Information Systems and Artificial Intelligence: Integration Aspects pp 104–126Cite as

Integrity and recursion: two key issues for deductive databases

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Bernstein and B. Blaustein, ”Fast methods for testing quantified relational calculus assertions”, in: Proc. 8th ACM-SIGMOD Conf. on Management of Data, Orlando, 1982

    Google Scholar 

  2. 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, 1988

    Google Scholar 

  3. M. Brodie and J. Mylopoulos [eds.], ”On Knowledge Base Management Systems”, Springer, 1986

    Google Scholar 

  4. 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), 1986

    Google Scholar 

  5. J. Bocca et.al., ”KB-Prolog: A Prolog for very large knowledge bases”, in: Proc. 7th British National Conf. on Databases (BNCOD), 1989

    Google Scholar 

  6. C. Beeri and R. Ramakrishnan, ”On the power of magic”, in: Proc. 6th ACM Symp. on Principles of Database Systems (PODS), 1987

    Google Scholar 

  7. 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. 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, 1988

    Google Scholar 

  9. U. Chakravarthy, J. Grant, and J. Minker, ”Foundations of semantic query optimization for deductive databases”, in: [Min88a]

    Google Scholar 

  10. S. Ceri, G, Gottlob, and L. Tanca, ”Logic programming and databases”, Springer, 1990

    Google Scholar 

  11. H. Decker, ”Integrity enforcement on deductive databases”, in: Proc. 1st Intern. Conf. on Expert Database Systems (EDS), Charleston, 1986

    Google Scholar 

  12. S.W. Dietrich, ”Extension tables: memo relations in logic programming”, in: Proc. Symp. on Logic Programming (SLP), San Francisco, 1987

    Google Scholar 

  13. H. Gallaire, J. Minker, and J.-M. Nicolas, ”Logic and databases: a deductive approach”, ACM Computing Surveys, Vol. 16, No. 2, 1984

    Google Scholar 

  14. T. Imielinski, ”Intelligent query answering in rule based systems”, Journal of Logic Programming, Vol. 4, No. 2, 1987

    Google Scholar 

  15. R. Kowalski, F. Sadri, and P. Soper, ”Integrity checking in deductive databases”, in: Proc. 13th Intern. Conf. on Very Large Databases (VLDB), Brighton, 1987

    Google Scholar 

  16. 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. U. Lipeck and G. Saake, ”Monitoring dynamic integrity constraints based on temporal logic”, Information Systems, Vol. 12, 1987

    Google Scholar 

  18. J. Lloyd, E. Sonenberg, and R. Topor, ”Integrity constraint checking in stratified databases”, Journal of Logic Programming, Vol. 4, No. 4, 1987

    Google Scholar 

  19. 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. 1989

    Google Scholar 

  20. 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. R. Manthey and F. Bry, ”SATCHMO: A theorem prover implemented in Prolog”, in: Proc. 9th Intern. Conf. on Automated Deduction (CADE), Chicago, 1988

    Google Scholar 

  22. W. McCune and L. Henschen, ”Maintaining state constraints in relational databases: A proof theoretic basis”, Journal of the ACM, Vol. 36, No. 1, 1989

    Google Scholar 

  23. J. Minker [ed.], ”Foundations of deductive databases and logic programming”, Morgan Kaufmann, 1988

    Google Scholar 

  24. J. Minker, ”Perspectives in deductive databases”, Journal of Logic Programming, Vol. 5, No. 1, 1988

    Google Scholar 

  25. A. Motro, ”Using integrity constraints to provide intensional answers to relational queries”, in: Proc. 15th Intern. Conf. on Very Large Databases (VLDB), Amsterdam, 1989

    Google Scholar 

  26. W. Nejdl, ”Recursive strategies for answering recursive queries — the RQA/FQI strategy”, in: Proc. 13th Intern. Conf. on Very Large Databases (VLDB), Brighton, 1987

    Google Scholar 

  27. J.-M. Nicolas, ”Logic for improving integrity checking in relational databases”, Acta Informatica, Vol. 18, No. 3, 1982

    Google Scholar 

  28. 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, 1989

    Google Scholar 

  29. 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, 1986

    Google Scholar 

  30. C.-D. Shum, R. Muntz, ”Implicit representation of extensional answers”, in: Proc. 2nd Intern. Conf. on Expert Database Systems (EDS), Tysons Corner, 1988

    Google Scholar 

  31. S. Shenoy and Z. Oszoyoglu, ”A system for semantic query optimization”, in: Proc. 13th ACM-SIGMOD Conf. on Management of Data, San Francisco, 1987

    Google Scholar 

  32. J. Schmidt and C. Thanos [eds.], ”Foundations of Knowledge Base Management”, Springer, 1989

    Google Scholar 

  33. H. Tamaki and T. Sato, ”OLD resolution with tabulation”, in: Proc. 3rd Intern. Conf. on Logic Programming (ICLP), London, 1986

    Google Scholar 

  34. J. Ullman, ”Principles of database and knowledge base systems”, Vol. 2, Computer Science Press, 1989

    Google Scholar 

  35. J. Ullman, ”Bottom-up beats top-down for Datalog”, in: Proc. 8th ACM Symp. on Principles of Database Systems (PODS), Philadelphia, 1989

    Google Scholar 

  36. M. van Emden and R. Kowalski, ”The semantics of predicate logic as a programming language”, Journal of the ACM, Vol. 23, No. 4, 1976

    Google Scholar 

  37. L. Vieille, ”Recursive axioms in deductive databases: The Query-Subquery approach”, in: Proc. 1st Intern. Conf. on Expert Database Systems (EDS), Charleston, 1986

    Google Scholar 

  38. L. Vieille, ”Recursive query processing: The power of logic”, Theoretical Computer Science, Vol. 69, No.1, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. European Computer-Industry Research Centre (ECRC), Arabellastr. 17, D-8000, München 81, Germany

    Rainer Manthey

Authors
  1. Rainer Manthey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dimitris Karagiannis

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manthey, R. (1991). Integrity and recursion: two key issues for deductive databases. In: Karagiannis, D. (eds) Information Systems and Artificial Intelligence: Integration Aspects. IS/KI 1990. Lecture Notes in Computer Science, vol 474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53557-8_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-53557-8_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53557-7

  • Online ISBN: 978-3-540-46809-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation