Skip to main content

Conceptual relations between databases transformed under join and projection

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

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

Abstract

The concept of equivalence among data bases is defined in terms of ability of two data bases of providing the same answer to equal (or corresponding) queries and of allowing equal (or corresponding) updates. After discussing some basic properties of the concepts introduced, the case in which conceptual relations (inclusion or equivalence) among data bases may be proved by means of transformations based on projections and joins is examined in detail.

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. G. Ausiello, C. Batini, M. Moscarini-On the equivalence among data base schemata — International Conference on Data Bases. Aberdeen, July 1980.

    Google Scholar 

  2. C. Beeri, A.O. Mendelzon, Y. Sagiv, J.D. Ullman — Equivalence of Relational Data base Schemes — Technical Report # 252, Princeton University (1978).

    Google Scholar 

  3. P. Bernstein, C. Beeri, N. Goodman — A Sophisticate's introduction to DB Normalization Theory — Proc. Conf. Very Large Data Bases — Berlin (1978).

    Google Scholar 

  4. M. Borkin — Data Model Equivalence — Proc. Conf. Very Large Data Bases — Berlin (1978).

    Google Scholar 

  5. M. Brodie — Specification and Verification of DB Semantic Integrity Constraints — Tecn. Rep. University of Toronto (1978).

    Google Scholar 

  6. E.F. Codd — Further Normalization on the Data base Relational Model in Data Base Systems — Prentice Hall (1972).

    Google Scholar 

  7. E.F. Codd — A relational Model of Data for Large Shared data banks-CACM June 1970.

    Google Scholar 

  8. E.F. Codd — Relational Completness of Data Base Sublanguages — in Data Base Systems — Prentice Hall (1972).

    Google Scholar 

  9. R. Fagin — Normal Forms and Relational Database Operators.SIGMOD 1979.

    Google Scholar 

  10. W.C. Mc Gee — A contribution to the Study of Data Equivalence — DB Management, Cargese (1974).

    Google Scholar 

  11. W. Lipski — On Semantic issues connected with Incomplete Information Databases. ACM TODS 4, 3, 1979.

    Google Scholar 

  12. S. Navathe, J. Fry — Restructuring for Large DB: Three Levels of Abstraction — ACM TODBS (1976).

    Google Scholar 

  13. P. Paolini — An Alternative Structure for DBMS — Proc. Conf. Very Large Data Bases — Berlin (1978).

    Google Scholar 

  14. E. Sciore — Improving Semantic Specification in a Relational Database — SIGMOD, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ausiello, G., Batini, C., Moscarini, M. (1980). Conceptual relations between databases transformed under join and projection. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022499

Download citation

  • DOI: https://doi.org/10.1007/BFb0022499

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics