Advertisement

Conceptual relations between databases transformed under join and projection

  • G. Ausiello
  • C. Batini
  • M. Moscarini
Communications
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Data Base Conceptual Relation Query Language Relation Income Integrity Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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. [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. [4]
    M. Borkin — Data Model Equivalence — Proc. Conf. Very Large Data Bases — Berlin (1978).Google Scholar
  5. [5]
    M. Brodie — Specification and Verification of DB Semantic Integrity Constraints — Tecn. Rep. University of Toronto (1978).Google Scholar
  6. [6]
    E.F. Codd — Further Normalization on the Data base Relational Model in Data Base Systems — Prentice Hall (1972).Google Scholar
  7. [7]
    E.F. Codd — A relational Model of Data for Large Shared data banks-CACM June 1970.Google Scholar
  8. [8]
    E.F. Codd — Relational Completness of Data Base Sublanguages — in Data Base Systems — Prentice Hall (1972).Google Scholar
  9. [9]
    R. Fagin — Normal Forms and Relational Database Operators.SIGMOD 1979.Google Scholar
  10. [10]
    W.C. Mc Gee — A contribution to the Study of Data Equivalence — DB Management, Cargese (1974).Google Scholar
  11. [11]
    W. Lipski — On Semantic issues connected with Incomplete Information Databases. ACM TODS 4, 3, 1979.Google Scholar
  12. [12]
    S. Navathe, J. Fry — Restructuring for Large DB: Three Levels of Abstraction — ACM TODBS (1976).Google Scholar
  13. [13]
    P. Paolini — An Alternative Structure for DBMS — Proc. Conf. Very Large Data Bases — Berlin (1978).Google Scholar
  14. [14]
    E. Sciore — Improving Semantic Specification in a Relational Database — SIGMOD, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • G. Ausiello
    • 1
  • C. Batini
    • 1
  • M. Moscarini
    • 1
  1. 1.CSSCCA — CNR and Istituto di AutomaticaUniversità di RomaItaly

Personalised recommendations