Skip to main content
SpringerLink
Log in

Update Propagation in Deductive Databases Using Soft Stratification

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2004)

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

Abstract

Update propagation in deductive databases can be implemented by combining rule rewriting and fixpoint computation, analogous to the way how query answering is performed via Magic Sets. For efficiency reasons, bottom-up propagation rules have to be subject to Magic rewriting, thus possibly loosing stratifiability. We propose to use the soft stratification approach for computing the well-founded model of the magic propagation rules (guaranteed to be two-valued) because of the simplicity and efficiency of this technique.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programs, pp. 89–148. M. Kaufmann, San Francisco (1988)

    Google Scholar 

  2. Balbin, I., Port, G.S., Ramamohanarao, K., Meenakshi, K.: Efficient bottom-up computation of queries. JLP 11(3&4), 295–344 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baralis, E., Widom, J.: A rewriting technique for using delta relations to improve condition evaluation in active databases. Technical Report CS-93-1495, Stanford University (November 1993)

    Google Scholar 

  4. Behrend, A.: Soft stratification for magic set based query evaluation in deductive databases. In: PODS 2003, New York, June 9–12, pp. 102–110 (2003)

    Google Scholar 

  5. Ceri, S., Widom, J.: Deriving incremental production rules for deductive data. Information Systems 19(6), 467–490 (1994)

    Article  Google Scholar 

  6. Griefahn, U.: Reactive Model Computation–A Uniform Approach to the Implementation of Deductive Databases. PhD Thesis, University of Bonn (1997)

    Google Scholar 

  7. Griffin, T., Libkin, L.: Incremental maintenance of views with duplicates. In: SIGMOD 1995, San Jose, May 23-25, pp. 328–339 (1995)

    Google Scholar 

  8. Gupta, A., Mumick, I.S., Ross, K.A.: Adapting materialized views after redefinitions. In: SIGMOD 1995, vol. 24(2), pp. 211–222 (1995)

    Google Scholar 

  9. Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. In: SIGMOD, vol. 22(2), pp. 157–166 (1993)

    Google Scholar 

  10. Küchenhoff, V.: On the efficient computation of the difference between consecutive database states. In: Delobel, C., Masunaga, Y., Kifer, M. (eds.) DOOD 1991. LNCS, vol. 566, pp. 478–502. Springer, Heidelberg (1991)

    Google Scholar 

  11. Levy, A.Y., Sagiv, Y.: Queries Independent of Updates. In: VLDB 1993, pp. 171–181. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  12. Manthey, R.: Reflections on some fundamental issues of rule-based incremental update propagation. In: DAISD 1994, September 19-21, pp. 255–276 (1994)

    Google Scholar 

  13. Martens, B., Bruynooghe, M.: Integrity constraint checking in deductive databases using a rule/goal graph. In: EDS 1988, pp. 567–601 (1988)

    Google Scholar 

  14. Moerkotte, G., Karl, S.: Efficient consistency control in deductive databases. In: Gyssens, M., Van Gucht, D., Paredaens, J. (eds.) ICDT 1988. LNCS, vol. 326, pp. 118–128. Springer, Heidelberg (1988)

    Google Scholar 

  15. Mumick, I.S., Pirahesh, H.: Implementation of magic-sets in a relational database system. In: SIGMOD, vol. 23(2), pp. 103–114 (1994)

    Google Scholar 

  16. Naughton, J.F., Ramakrishnan, R., Sagiv, Y., Ullman, J.D.: Efficient Evaluation of Right-, Left-, and Multi-Linear Rules. In: SIGMOD 1989, pp. 235–242 (1989)

    Google Scholar 

  17. Olivé, A.: Integrity constraints checking in deductive databases. In: VLDB, pp. 513–523 (1991)

    Google Scholar 

  18. Sadri, F., Kowalski, R.A.: A theorem proving approach to database integrity. In: Foundations of Deductive Databases and Logic Programs, pp. 313–362. M. Kaufmann, San Francisco (1988)

    Google Scholar 

  19. T. Urpí, A. Olivé. A method for change computation in deductive databases. In: VLDB 1992, Vancouver, August 23-27, pages 225–237 (1992)

    Google Scholar 

  20. van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47(1), 185–221 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  21. Vieille, L., Bayer, P., Küchenhoff, V.: Integrity checking and materialized views handling by update propagation in the EKS-V1 system. Technical Report TR-KB-35, ECRC, München (June 1991)

    Google Scholar 

  22. Wüthrich, B.: Detecing inconsistencies in deductive databases. Technical Report 1990TR-123, Swiss Federal Institute of Technology, ETH (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science III, University of Bonn, Römerstr. 164, D-53117, Bonn, Germany

    Andreas Behrend & Rainer Manthey

Authors
  1. Andreas Behrend
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rainer Manthey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Data Mining and Web search Research Group, Informatics Laboratory Computer and Automation Research Institute of the Hungarian Academy of Sciences,  

    András Benczúr

  2. MTA SZTAKI, Computer and Automation Institute, of the Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary

    János Demetrovics

  3. Oxford University Computing Laboratory, Wolfson Building Parks Road, OX1 3QD, Oxford, United Kingdom

    Georg Gottlob

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behrend, A., Manthey, R. (2004). Update Propagation in Deductive Databases Using Soft Stratification. In: Benczúr, A., Demetrovics, J., Gottlob, G. (eds) Advances in Databases and Information Systems. ADBIS 2004. Lecture Notes in Computer Science, vol 3255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30204-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30204-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23243-8

  • Online ISBN: 978-3-540-30204-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation