Skip to main content
Springer Nature Link
Log in

On the efficient computation of the difference between consecutive database states

  • Conference paper
  • First Online:
Deductive and Object-Oriented Databases (DOOD 1991)

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

Included in the following conference series:

  • 172 Accesses

Abstract

For a deductive database we present an algorithm to efficiently compute the changes in virtual predicates induced by updates. We first define different classes of potential changes introduced by updates. These definitions are expressed as rules, and merged into the rules defining the database views. This enables the system to determine changes induced by an update with minimum redundancy. Moreover the evaluation of the merged rules mirror the evaluation of the rules defining the views: as a result no new evaluation machinery is needed, and any optimizations applied to the rules defining the views are inherited by the merged rules. The method is introduced by giving a detailed analysis of the difference between two states. We describe a mechanism compiling the original rules into a format amenable to a standard query evaluator. The algorithm is applied to the integrity checking problem. The integrity constraints are boolean views, defined by rules, and their validity after an update is checked by computing the induced changes on predicates defined by these rules.

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.

Similar content being viewed by others

References

  1. K.R. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In Minker J., editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann, 1986.

    Google Scholar 

  2. F. Bry, H. Decker, and R. Manthey. A uniform approach to constraint satisfaction and constraints satisfiability in deductive databases. In Proc. of the 1st International Conf. on Extending Database Technology (EDBT), Venice, Italy, August 1988.

    Google Scholar 

  3. F. Bry, R. Manthey, and B. Martens. Integrity verification in knowledge bases. ESPRIT BRA Compulog NO. 3012 deliverable D.2.1.a, ECRC, Munich, Germany, 1990.

    Google Scholar 

  4. Jorge Bocca. MegaLog — a plattform for developing knowledge base management systems. In Proc. of the 2nd Int. Symp. on Database Systems for Advanced Applications (DASFAA), Tokyo, Japan, April 1991.

    Google Scholar 

  5. Francois Bry. Maintaining integrity of deductive databases. Internal report KB-45, ECRC, Munich, Germany, July 1987.

    Google Scholar 

  6. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer Verlag, 1990.

    Google Scholar 

  7. S. Ceri and J. Widom. Deriving production rules for constraint maintenance. In Proc. of the 16 nd Int. Conf. on Very large Data Bases (VLDB), Brisbane, Australia, August 1990.

    Google Scholar 

  8. S. Ceri and J. Widom. Deriving production rules for incremental view maintenance. In Proc. of the 17 nd Int. Conf. on Very large Data Bases (VLDB), Barcelona, Spain, August 1991.

    Google Scholar 

  9. Douglas W. Cornell and Philip S. Yu. Integration of buffer management and query optimization in relational database environment. In Proc. of the 15 nd Int. Conf. on Very large Data Bases (VLDB), Amsterdam, The Netherlands, August 1989.

    Google Scholar 

  10. Benoit David. Map is better than graph to store topology. In Poster Presentation at EuroCarto 7, September 1989.

    Google Scholar 

  11. H. Decker and L. Cavadon. Generalizing allowed and other properties which ensure the completeness of SLDNF-resolution. In Egon Börger et al., editor, Proc. of the 3rd CSL Workshop, Kaiserslautern. Springer LNCS 440, 1990.

    Google Scholar 

  12. Hendrik Decker. Integrity enforcement on deductive databases. In Kerschberg L., editor, Proc. of the 1st Int. Conference on Expert Database Systems, pages 271–285, Charleston, SC, USA, April 1986.

    Google Scholar 

  13. Hendrik Decker. The range form of databases and queries. In Proc. of the 5th Ögai, Informatik Fachberichte 218, pages 114–123. Springer Verlag, 1989.

    Google Scholar 

  14. Hendrik Decker. Drawing updates from derivations. In Proc. of the Int. Conference on Database Theory (ICDT), pages 437–451, Paris, France, 1990.

    Google Scholar 

  15. Hendrik Decker. On generalized cover axioms. In Proc. of the 8 th Int. Conf. and Symp. on Logic Programming (ICLP), Paris, France, 1991.

    Google Scholar 

  16. S.K. Das and M.H. Williams. A path finding method for constraint checking in deductive databases. Data and Knowledge Engeneering, 4:223–244, 1989.

    Google Scholar 

  17. Mike Freeston. The BANG file: a new kind of grid file. In Traiger U. Dayal Y., editor, Proc. of the ACM Conference on the Management of Data (SIGMOD), pages 260–269, San Francisco, May 27–29 1987.

    Google Scholar 

  18. Johann Christoph Freytag. The basic principles of query optimization in relational database management systems. Information Processing, pages 801–807, 1989.

    Google Scholar 

  19. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5 th Int. Conf. and Symp. on Logic Programming (ICLP), pages 1070–1080, Seattle, 1988.

    Google Scholar 

  20. Ulrike Griefahn and Stefan Luettringhaus. Top-down integrity constraint checking for deductive databases. In Proc. of the 7th Int. Conf. and Symp. on Logic Programming (ICLP), Jerusalem, Israel, 1990.

    Google Scholar 

  21. H. Gallaire, J. Minker, and J.M. Nicolas. Logic and databases: a deductive approach. ACM Computing Surveys, 16(2), June 1984.

    Google Scholar 

  22. Matthias Jarke and Juergen Koch. Query optimisation in database systems. Computing Surveys, 16(2), June 1984.

    Google Scholar 

  23. Bo Kaehler and Oddvar Risnes. Extending logging for database snapshot refresh. In Proc. of the 13 nd Int. Conf. on Very large Data Bases (VLDB), Brighton, England, August 1987.

    Google Scholar 

  24. R. Kowalski, F. Sadri, and P. Soper. Integrity checking in deductive databases. In Proc. of the 13nd Int. Conf. on Very large Data Bases (VLDB), Brighton, England, August 1987.

    Google Scholar 

  25. Volker Küchenhoff. The delta method applied to integrity checking. Technical Report TR-KB-37, ECRC, Munich, Germany, February 1991.

    Google Scholar 

  26. Kenneth Kunen. Signed data dependencies in logic programs. Journal of Logic Programming, 7(3), 1989.

    Google Scholar 

  27. Alexander Lefebvre. Recursive aggregates in the EKS-V1 system. Technical Report TR-KB-34, ECRC, Munich, Germany, February 1991.

    Google Scholar 

  28. Bruce Linday, Laura Haas, and C. Mohan. A snapshot differential refresh algorithm. In Proc. Int. Conf. on Management of Data, May 1986.

    Google Scholar 

  29. J.W. Lloyd. Foundations of Logic Programming, 2nd edition. Springer-Verlag, 1987.

    Google Scholar 

  30. J. Lloyd, E. Sonenberg, and R. Topor. Integrity constraint checking in stratified databases. Journal of Logic Programming, 4(4):331–343, 1987.

    Google Scholar 

  31. J.W. Lloyd and R.W. Topor. Making prolog more expressive. Journal of Logic Programming, 1(3):225–240, 1984.

    Google Scholar 

  32. M. Meier, A. Aggoun, D. Chan, P. Dufresne, R. Enders, D. De Villeneuve, A. Herold, P. Kay, B. Perez, E.Van Rossum, and J. Schimpf. Sepia — an extendible prolog system. In G. X. Ritter, editor, Information Processing 89, San Francisco, September 1989. Elsevier Science Publisher B.V.

    Google Scholar 

  33. Nobuyoshi Miyazaki. Trends in query optimization methods for deductive databases. In Advanced Database System Symposium, Kyoto, Japan, December 1989.

    Google Scholar 

  34. Guido Moerkotte and Stefan Karl. Efficient consistency control in deductive databases. In Proc. of the 2 nd Int. Conference on Database Theory (ICDT), Bruges, Belgium, 1988. Springer Verlag.

    Google Scholar 

  35. L. Naish. Automating control for logic programs. Journal of Logic Programming, pages 167–183, 1985.

    Google Scholar 

  36. J.M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18(3):227–253, 1982.

    Google Scholar 

  37. J.M. Nicolas and K. Yazdanian. An outline of BDGEN: a deductive DBMS. In Proc. of the IFIP World Congress, 1983.

    Google Scholar 

  38. Antoni Olive. Integrity constraints checking in deductive databases. In Proc. of the 17 nd Int. Conf. on Very large Data Bases (VLDB), Barcelona, Spain, September 1991.

    Google Scholar 

  39. J.A. Pastor. The internal events method for integrity checking in deductive database systems. In Proc. of the workshop on the deductive approach in Databases and Information Systems, Agaro, Spain, 1990.

    Google Scholar 

  40. Derr M.A. Phipps G. Glue-Nail: A Deductive Database System. In J. Clifford and R. King, editors, Proc. of the ACM SIGMOD International Conference on Management of Data, pages 308–317, Denver, Colorado, May 1991.

    Google Scholar 

  41. T.C. Przymusinski. On the Semantics of Stratified Deductive databases. In Minker J., editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, 1987.

    Google Scholar 

  42. R. Ramakrishnan, P. Bothner, D. Srivastava, and S. Sudarshan. CORAL — A Database Programming Language. In Proc. of the NACLP 90, Workshop on Deductive Databases, Department of Computing and Information Science, Kansas State University, Oct. 1990.

    Google Scholar 

  43. P. G. Selinger et al. Access path selection in a relational database management system. In Proc. of the SIGMOD Conference, Boston, Massachusetts, June 1979.

    Google Scholar 

  44. A. Swami and A. Gupta. Optimization of large join queries. In Proc. of the SIGMOD Conference, Chicago, Illinois, June 1988.

    Google Scholar 

  45. L. Vieille, P. Bayer, and V. Küchenhoff. Integrity checking and materialized views handling by update propagation in the EKS-V1 system. TR-KB-35, ECRC, Munich, Germany, June 1991.

    Google Scholar 

  46. L. Vieille, P. Bayer, V. Küchenhoff, A. Lefebvre, and R. Manthey. Documentation for EKS-V1. TR-KB-36, ECRC, July 1991.

    Google Scholar 

  47. L. Vieille, P. Bayer, V. Küchenhoff, A. Lefebvre, and R. Manthey. An overview of the EKS-V1 system. Technical Report TR-KB-38, ECRC, Munich, Germany, September 1991.

    Google Scholar 

  48. L. Vieille, P. Bayer, V. Küchenhoff, and A. Lefebvre. EKS-V1, a short overview. In AAAI-Workshop on Knowledge Base Management Systems, Boston, Ma, 1990.

    Google Scholar 

  49. J. Vaghani, K. Ramamohanarao, D.B. Kemp, Z Somogyi, and P.J. Stuckey. Design overview of the aditi deductive database system. In NACLP Workshop on Deductive Databases, Department of Computing and Information Science, Kansas State University, October 1990.

    Google Scholar 

  50. Mark Wallace. KB2: A knowledge base system embedded in Prolog. Technical Report TR-KB-12, ECRC, Munich, Germany, August 1986.

    Google Scholar 

  51. Mark Wallace. Compiling integrity checking into update procedures. In Proc. of the 13 th IJCAI, Sydney, Australia, August 1991.

    Google Scholar 

  52. Beat Wuethrich. Detecting inconsistencies in deductive databases. Technical report, ETH Zuerich, January 1990.

    Google Scholar 

  53. C. Zaniolo. Deductive databases: Theory meets practice. In Proc. of the 2nd International Conf. on Extending Database Technology (EDBT), Venice, Italy, March 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Volker Küchenhoff

Authors
  1. Volker Küchenhoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Delobel M. Kifer Y. Masunaga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Küchenhoff, V. (1991). On the efficient computation of the difference between consecutive database states. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-55015-1_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46646-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics