Skip to main content
SpringerLink
Log in

A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases

  • Conference paper
Foundations of Information and Knowledge Systems (FoIKS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4932))

Abstract

In this paper we present a new rule-based approach for consistency preserving view updating in deductive databases. Based on rule transformations performed during schema design, fixpoint evaluations of these rules at run time compute consistent realizations of view update requests. Alternative realizations are expressed using disjunctive Datalog internally. The approach extends and integrates standard techniques for efficient query answering and integrity checking (based on transformation techniques and fixpoint computation, too). Views may be stratifiably recursive. The set-orientedness of the approach makes it potentially useful in the context of (commercial) SQL systems, too.

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. Aravindan, C., Baumgartner, P.: Theorem Proving Techniques for View Deletion in Databases. Journal of Symbolic Computation 29(2), 119–147 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abdennadher, S., Schütz, H.: Model Generation with Existentially Quantified Variables and Constraints. ALP/HOA, 256–272 (1997)

    Google Scholar 

  3. Bry, F., Decker, H., Manthey, R.: A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases. In: Schmidt, J.W., Missikoff, M., Ceri, S. (eds.) EDBT 1988. LNCS, vol. 303, pp. 488–505. Springer, Heidelberg (1988)

    Google Scholar 

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

    Google Scholar 

  5. Behrend, A.: A Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol. 4690, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Behrend, A., Manthey, R.: Update Propagation in Deductive Databases Using Soft Stratification. In: Benczúr, A.A., Demetrovics, J., Gottlob, G. (eds.) ADBIS 2004. LNCS, vol. 3255, pp. 22–36. Springer, Heidelberg (2004)

    Google Scholar 

  7. Bry, F.: Intensional Updates: Abduction via Deduction. In: ICLP 1990, pp. 561–575 (1990)

    Google Scholar 

  8. Eckert, H.: Ein regelbasierter Ansatz zur Analyse von Sichtenänderungswünschen in stratifizierbaren deduktiven Datenbanken. Master Thesis, University of Bonn (2004)

    Google Scholar 

  9. Farré, C., Teniente, E., Urpí, T.: Query Containment Checking as a View Updating Problem. In: Quirchmayr, G., Bench-Capon, T.J.M., Schweighofer, E. (eds.) DEXA 1998. LNCS, vol. 1460, pp. 310–321. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Grant, J., Horty, J., Lobo, J., Minker, J.: View Updates in Stratified Disjunctive Databases. JAR 11(2), 249–267 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Griefahn, U.: Reactive Model Computation - A Uniform Approach to the Implementation of Deductive Databases. Dissertation, University of Bonn (1997), http://www.cs.uni-bonn.de/~idb/publications/diss_griefahn.ps.gz

  12. Inoue, K., Sakama, C.: A Fixpoint Characterization of Abductive Logic Programs. JLP 27(2), 107–136 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  13. 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 

  14. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge (1992)

    Google Scholar 

  15. Levy, A., Mumick, I., Sagiv, Y., Shmueli, O.: Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions. In: PODS 1993, pp. 109–122 (1993)

    Google Scholar 

  16. Lloyd87, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)

    Google Scholar 

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

    Google Scholar 

  18. Olivé, A.: Integrity Constraints Checking In Deductive Databases. In: VLDB 1991, pp. 513–523 (1991)

    Google Scholar 

  19. Przymusinski, T.: Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model. In: PODS 1989, pp. 11–21 (1989)

    Google Scholar 

  20. Sagiv, Y.: Optimizing Datalog Programs. Foundations of Deductive Databases and Logic Programming, 659–698 (1988)

    Google Scholar 

  21. Seipel, D., Minker, J., Ruiz, C.: Model Generation and State Generation for Disjunctive Logic Programs. Journal of Logic Programming 32(1), 49–69 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  22. Teniente, E., Olivé, A.: The Events Method for View Updating in Deductive Databases. In: Pirotte, A., Delobel, C., Gottlob, G. (eds.) EDBT 1992. LNCS, vol. 580, pp. 245–260. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  23. Teniente, E., Urpi, T.: On the abductive or deductive nature of database schema validation and update processing problems. TPLP 3(3), 287–327 (2003)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science III, University of Bonn, Roemerstr. 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

Sven Hartmann Gabriele Kern-Isberner

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behrend, A., Manthey, R. (2008). A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77684-0_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77683-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation