Skip to main content

Solving ambiguities in updating deductive databases

  • Update And Queries
  • Conference paper
  • First Online:

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

Abstract

In a Datalog database, updates to intensionally defined relations give rise to problems similar to those related to view updates: it is often difficult to implement them in an unambiguous way by means of updates to base relations. In this paper we show how such ambiguities can be solved at operation time by requiring exactly the missing information. We first formalize a declarative, model-theoretic semantics of updates, with potential, minimal, and deterministic results; then, we present an operational, proof-theoretic approach, based on SLD-resolution, that turns out to be equivalent to the declarative one; finally, algorithms to correctly perform the updates, based on the procedural semantics, are given. When, while performing an update, different solutions can be followed, the needed information to solve the ambiguity is required.

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Atzeni and R. Torlone. Efficient updates to independent schemes in the weak instance model. In ACM SIGMOD International Conf. on Management of Data, pages 84–93, 1990.

    Google Scholar 

  2. P. Atzeni and R. Torlone. Updating databases in the weak instance model. In Eight ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 101–109, 1989.

    Google Scholar 

  3. P. Atzeni and R. Torlone. Updating Datalog Databases. To appear in the Proceedings of East West Workshop on Database Technology, Springer-Verlag, 1991.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

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

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

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

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

  12. A.M. Keller. Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In Fourth ACM SIGACT SIGMOD Symp. on Principles of Database Systems, pages 154–163, 1985.

    Google Scholar 

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

    Google Scholar 

  14. 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, 1987.

    Google Scholar 

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

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

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

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

    Google Scholar 

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

  20. M. Winslett. A framework for the comparison of update semantics. In Seventh ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 315–324, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Atzeni, P., Torlone, R. (1991). Solving ambiguities in updating 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_8

Download citation

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

  • 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