Skip to main content
SpringerLink
Log in

Updating deductive databases with functional dependencies

  • 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:

Abstract

We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions of representability, consistency and determinism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.

Work supported by Ministero della Pubblica Istruzione, within the project: “Metodi formali e strumenti per basi di dati evolute” and by CNR, “PF Sistemi Informatici e Calcolo Parallelo, Sottoprogetto 5, LRC LOGIDATA+”.

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. S. Abiteboul. Updates, a new frontier. In ICDT'88 (Second International Conference on Data Base Theory), Bruges, Lecture Notes in Computer Science 326, pages 1–18, Springer-Verlag, 1988.

    Google Scholar 

  2. P. Atzeni and R. Torlone. Solving ambiguities in updating deductive databases. In MFDBS'91 (Mathematical Fundamentals of Data Base Systems), Rostock, Germany, Lecture Notes in Computer Science 495, pages 104–118, Springer-Verlag, 1991.

    Google Scholar 

  3. P. Atzeni and R. Torlone. Updating databases in the weak instance model. In Eigth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 101–109, 1989. Full version to appear in ACM Trans. on Database Syst.

    Google Scholar 

  4. P. Atzeni and R. Torlone. Updating datalog databases. In Next Generation Information Systems Technology, Kiev, Soviet Union, Lecture Notes in Computer Science 504, Pages 347–362, 1990.

    Google Scholar 

  5. F. Bancilhon and N. Spyratos. Update semantics of relational views. ACM Trans. on Database Syst., 6(4):557–575, 1981.

    Google Scholar 

  6. F. Bry. Intensional updates: abduction via deduction. In 7th International Conference on Logic Programming, 1990.

    Google Scholar 

  7. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Data Bases. Springer-Verlag, 1989.

    Google Scholar 

  8. S.S. Cosmadakis, H. Gaifman, P.C. Kanellakis, and M. Vardi. Decidable optimization problems for database logic programs. In Twentieth ACM SIGACT Symp. on Theory of Computing, pages 477–490, 1988.

    Google Scholar 

  9. S.S. Cosmadakis and C.H. Papadimitriou. Updates of relational views. Journal of the ACM, 31(4):742–760, October 1984.

    Google Scholar 

  10. U. Dayal and P.A. Bernstein. On the correct translation of update relations on relational views. ACM Trans. on Database Syst., 8(3):381–416, September 1982.

    Google Scholar 

  11. H. Decker. Drawing updates from derivations. In ICDT'90 (Third International Conference on Data Base Theory), Paris, Lecture Notes in Computer Science 470, pages 437–451, Springer-Verlag, 1990.

    Google Scholar 

  12. R. Fagin, G.M. Kuper, J.D. Ullman, and M.Y. Vardi. Updating logical databases. In P.C. Kanellakis and F.P. Preparata, editors, Advances in Computing Research, Vol.3, pages 1–18, JAI Press, 1986.

    Google Scholar 

  13. G. Gottlob, P. Paolini, and R. Zicari. Properties and update semantics of consistent views. ACM Trans. on Database Syst., 13(4):486–524, December 1988.

    Google Scholar 

  14. A.C. Kakas and P. Mancarella. Database updates through abduction. In Sixteenth International Conference on Very Large Data Bases, Brisbane, pages 650–661, 1990.

    Google Scholar 

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

    Google Scholar 

  16. D. Maier, A.O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. on Database Syst., 4(4):455–468, 1979.

    Google Scholar 

  17. S. Manchanda and D.S. Warren. A logic-based language for database updates. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 363–394, Morgan Kauffman, Los Altos, 1988.

    Google Scholar 

  18. A.O. Mendelzon and P.T. Wood. Functional dependencies in Horn clause queries. ACM Trans. on Database Syst., 16(1):31–55, 1991.

    Google Scholar 

  19. S.A. Naqvi and R. Krishnamurthy. Database updates in logic programming. In Seventh ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 251–262, 1988.

    Google Scholar 

  20. J. Naughton. Data independent recursion in deductive databases. In Fifth ACM SIGACT SIGMOD Symp. on Principles of Database Systems, pages 267–279, 1986.

    Google Scholar 

  21. J. Naughton. Minimizing function-free recursive inference rules. Journal of the ACM, 36(1):69–91, 1989.

    Google Scholar 

  22. F. Rossi and S.A. Naqvi. Contributions to the view update problem. In 6th International Conference on Logic Programming, pages 398–415, 1989.

    Google Scholar 

  23. Y. Sagiv. Optimizing datalog programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 627–658, Morgan Kauffman, Los Altos, 1988.

    Google Scholar 

  24. A. Tomasic. View update translation via deduction and annotation. In ICDT'88 (Second International Conference on Data Base Theory), Bruges, Lecture Notes in Computer Science 326, pages 338–352, Springer-Verlag, 1988.

    Google Scholar 

  25. J.D. Ullman. Principles of Database and Knowledge Base Systems. Volume 1, Computer Science Press, Potomac, Maryland, 1988.

    Google Scholar 

  26. M.Y. Vardi. Decidability and undecidability results for boundedness of linear recursive queries. In Seventh ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 341–351, 1988.

    Google Scholar 

  27. M.W. Wilkins. A model-theoretic approach to updating logical databases. In Fifth ACM SIGACT SIGMOD Symp. on Principles of Database Systems, pages 224–234, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IASI-CNR, Viale Manzoni, 30, 00185, Roma, Italy

    Riccardo Torlone

  2. Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria, 113, 00198, Roma, Italy

    Paolo Atzeni

Authors
  1. Riccardo Torlone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Atzeni
    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

Torlone, R., Atzeni, P. (1991). Updating deductive databases with functional dependencies. 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_15

Download citation

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

  • 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

Search

Navigation