Skip to main content
SpringerLink
Log in

Semantic improvement of deductive databases

  • Deductive Database
  • Conference paper
  • First Online:
MFDBS 91 (MFDBS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 495))

Included in the following conference series:

  • 127 Accesses

Abstract

We assume that there is a deductive database 〈D, C〉, where D is a set of stratified rules and facts and C a set of constraints. Querying a database means returning all ground instances of the query which are true in the well defined standard model M D induced by D. Given a query Q it is transformed into a new query Q′, such that Q′ will be less costly to be evaluated than Q, and such that Q′ is guaranteed to return the same answer provided that the constraints and rules are satisfied by M D. This transformation is called Semantic Query Optimization (SQO). First we show four ways of transforming a query into a new one. This assures high flexibility for runtime SQO. Afterwards, the method is adapted in order to simplify (may be at compile time) the rules and constraints. The proposed simplifications are such that M D remains the same and such that the simplfied database is consistent iff the original one was. Henceforth, the inference process is heavily improved due to the simplified rules, and the work to be done to check the integrity is reduced since the constraints are simplified. Finally, we turn to query evaluation again and show when a rule may be ignored during the evaluation of a query.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R.Apt, H.A.Blair, A.Walker, Towards a Theory of Declarative Knowledge, in Foundations of Deductive Databases and Logic Programming, edited by J.Minker, Morgan Kaufmann Publishers, 1988. {pp.89–148}

    Google Scholar 

  2. F.Bancilhon, D.Maier, Y.Sagiv, J.D.Ullmann, Magic Sets and Other Strange Ways to Implement Logic Programs, in Proceedings 5th ACM Symposium on Principles of Databse Systems (PODS), 1986. {pp.1–15}

    Google Scholar 

  3. edited by J.Barwise, Handbook of Mathematical Logic, North-Holland Publishing Company, 1985.

    Google Scholar 

  4. J.Biskup, B. Convent, Towards a Schema Design Methodology for Deductive Databases, in Proceedings of the 2nd Symposium on Mathematical Fundamentals of Database Systems (MFDBS 89), edited by G. Goos an J. Hartmann, Springer-Verlag, 1989. {pp.37–52}

    Google Scholar 

  5. F.Bry, Logical Rewritings for Improving the Evaluation of Quantified Queries, in Proceedings of the 2nd Symposium on Mathematical Fundamentals of Database Systems (MFDBS), 1989. {pp.100–116}

    Google Scholar 

  6. U.S.Chakravarthy, J.Grant, J.Minker, Foundations of Semantic Query Optimization for Deductive Databases, in Foundations of Deductive Databases and Logic Programming, edited by J.Minker, Morgan Kaufmann Publishers, 1988. {pp.243–273}

    Google Scholar 

  7. U.S. Chakravarthy, J. Grant, J. Minker, Logic-Based Approach to Semantic Query Optimization, in ACM Transactions on Database Systems, Vol 15, No 2, June 1990. {pp.162–207}

    Google Scholar 

  8. B.Convent, Detecting Redundant Clauses or Premise within Logic-Oriented Database Schemas, in Proceedings of the First International Workshop on Foundations of Models and Languages for Data and Objects, Aigen Austria, 1989. {pp.135–155}

    Google Scholar 

  9. M.Davis, H. Putnam, A Computing Procedure for Quantification Theory, in the Journal of the ACM, 1960. {pp.201–215}

    Google Scholar 

  10. L.M.Haas, J.C.Freytag, G.M.Lohmann, H.Pirahesh, Extensible Query Processing in Starburst, in Proceedings of the ACM-SIGMOD International Conference on Management of Data, 1989. {pp.377–388}

    Google Scholar 

  11. A.R.Helm, Detecting and Eliminating Redundant Derivations in Logic Knowledge Bases, in Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD), 1989. {pp.247–263}

    Google Scholar 

  12. M. Jarke, J. Clifford, Y. Vassiliou, An Optimizing Prolog Front-End To a Relational Query System, in Proceedings of the ACM-SIGMOD Conference on Management of Data, 1984. {pp.296–306}

    Google Scholar 

  13. J.J.King, QUIST: A System for Semantic Query Optimization in Relational Databases, in Proceedings of 7th VLDB Conference, 1981. {pp.510–517}

    Google Scholar 

  14. J.W.Lloyd, Foundations of Logic Programming, Springer-Verlag, second edition, 1987.

    Google Scholar 

  15. J.Lobo, J.Minker, A Metaprogramming Approach to Semantically Optimize Queries in Deductive Databases, in Proceedings of the Second International Conference on Expert Database Systems, edited by L.Kerschberg, 1989. {pp.699–741}

    Google Scholar 

  16. M.J.Maher, Equivalence of Logic Programs, in Foundations of Deductive Databases and Logic Programming, edited by J.Minker, Morgan Kaufmann Publishers, 1988. {pp.627–658}

    Google Scholar 

  17. R.Manthey, Satisfiability of Integrity Constraints: Reflections on a Neglected Problem, in Proceedings of the 2nd Workshop on Foundations of Models and Languages for Data and Objects, Informatik-Bericht 90-3, TU Clausthal, Aigen Austria, 1990. {pp.169–179}

    Google Scholar 

  18. A.Pirotte, D. Roelants, Constraints for Improving the Generation of Intensional Answers in a Deductive Database, in Proceedings of the Fifth International Conference on Data Engineering, 1989. {pp.652–659}

    Google Scholar 

  19. Y.Sagiv, Optimizing Datalog Programs, in Foundations of Deductive Databases and Logic Programming, edited by J.Minker, Morgan Kaufmann Publishers, 1988. {pp.659–698}

    Google Scholar 

  20. S.T.Shenoy, Z.M. Oszoyoglu, A System for Semantic Query Optimization, in Proceedings of the ACM-SIGMOD Conference on Management of Data, 1987. {pp.181–195}

    Google Scholar 

  21. M.D. Siegel, Automatic Rule Derivation for Semantic Query Optimization, in Proceedings of the Second International Conference on Expert Database Systems, editor L.Kerschberg, 1989. {pp.669–698}

    Google Scholar 

  22. E.A.Sonenberg, R.W.Topor, On Domain Independent Databases, in Foundations of Deductive Databases and Logic Programming, edited by J.Minker, Morgan Kaufmann Publishers, 1988. {pp.217–240}

    Google Scholar 

  23. M.E. Stickel, An Introduction to Automated Deduction, in Fundamentals of Artificial Intelligence, edited by G.Goo, J.Hartmanis, W.Bibel, Ph.Jorrand, Springer Verlag, Lecture Notes in Computer Science, Vol 232, 1985. {pp.87–88}

    Google Scholar 

  24. B.Wüthrich, Detecting Inconsistencies in Deductive Databases, Swiss Federal Institute of Technology (ETH), Zurich, Report No. 123, January 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informationssysteme, Swiss Federal Institute of Technology (ETH) Zurich, ETH-Zentrum, 8092, Zurich, Switzerland

    Beat Wüthrich

Authors
  1. Beat Wüthrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Thalheim János Demetrovics H. -D. Gerhardt

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wüthrich, B. (1991). Semantic improvement of deductive databases. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-54009-1_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54009-0

  • Online ISBN: 978-3-540-47348-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation