Skip to main content

Approaches to updates over weak instances

  • Conference paper
  • First Online:
Book cover MFDBS 89 (MFDBS 1989)

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

Included in the following conference series:

Abstract

Database updates have recently received much more attention than in the past. In this trend, a few approaches have been proposed with respect the problem of updating databases through interfaces based on the weak instance model.

Insertions and deletions of tuples are considered.

It is possible to distinguish between semantic and heuristic, or computational, approaches. The two semantic approaches turn out to be very similar, even if they have different origins, and are more general than the heuristic approaches.

Mail should be addressed to the first author at IASI-CNR, where he holds a cross-appointment. Work was 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, “Obiettivo LOGIDATA+”.

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

Access this chapter

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 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 M.C. De Bernardis. A new basis for the weak instance model. In Sixth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 79–86, 1987.

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

    Google Scholar 

  4. G. Birkhoff. Lattice Theory. Colloquium Publications, Volume XXV, American Mathematical Society, third edition, 1967.

    Google Scholar 

  5. J. Biskup and H.H. Bruggemann. Data manipulation languages for the universal relation view DURST. In MFDBS87, LNCS 305, pages 20–41, Springer-Verlag, 1988.

    Google Scholar 

  6. V. Brosda and G. Vossen. Update and retrieval in a relational database through a universal scheme interface. ACM Trans. on Database Syst., 13(4):449–485, 1988.

    Google Scholar 

  7. E.F. Codd. 'Universal’ relation fails to replace relational model (letter to the editor). IEEE Software, 5(4):4–6, 1988.

    Google Scholar 

  8. S.S. Cosmadakis, P.C. Kanellakis, and N. Spyratos. Partition semantics for relations. Journal of Comp. and System Sc., 33(1):203–233, 1986.

    Google Scholar 

  9. P. Honeyman. Testing satisfaction of functional dependencies. Journal of the ACM, 29(3):668–677, 1982.

    Article  Google Scholar 

  10. C. Lecluse and N. Spyratos. Implementing queries and updates on universal scheme interfaces. In Fourteenth International Conference on Very Large Data Bases, Los Angeles, pages 62–75, 1988.

    Google Scholar 

  11. D. Maier. The Theory of Relational Databases. Computer Science Press, Potomac, Maryland, 1983.

    Google Scholar 

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

  13. D. Maier, D. Rozenshtein, and D.S. Warren. Window functions. In P.C. Kanellakis and F. Preparata, editors, Advances in Computing Research, Vol.3, pages 213–246, JAI Press, 1986.

    Google Scholar 

  14. D. Maier, J.D. Ullman, and M. Vardi. On the foundations of the universal relation model. ACM Trans. on Database Syst., 9(2):283–308, 1984.

    Google Scholar 

  15. A.O. Mendelzon. Database states and their tableaux. ACM Trans. on Database Syst., 9(2):264–282, 1984.

    Google Scholar 

  16. Y. Sagiv. A characterization of globally consistent databases and their correct access paths. ACM Trans. on Database Syst., 8(2):266–286, 1983.

    Google Scholar 

  17. N. Spyratos. The partition model — a deductive database model. ACM Trans. on Database Syst., 12(1):1–37, 1987.

    Google Scholar 

  18. J.D. Ullman. Principles of Database Systems. Computer Science Press, Potomac, Maryland, second edition, 1982.

    Google Scholar 

  19. M.Y. Vardi. Response to a letter to the editor. IEEE Software, 5(4):4–6, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

János Demetrovics Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atzeni, P., Torlone, R. (1989). Approaches to updates over weak instances. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_2

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51251-6

  • Online ISBN: 978-3-540-46182-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics