Skip to main content

On semantic issues in the relational model of data

  • Invited Lecturers
  • Conference paper
  • First Online:

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

Abstract

This paper discusses the semantics of Codd's relational model of data, considered as being time-independent properties of the relations describing the data. The paper emphasizes those properties which are expressible in terms of the relations present in the data base, as opposed to the properties which relate the data base to the outside world. Among the semantic properties being discussed are the functional dependencies, the weak dependencies, the integrity constraints and the cross-referencing of the data base entities.

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. J.R.Abrial, ‘Data Semantics’ in J.W.Klimbie (ed.), ‘Data Base Management', North Holland, 1974

    Google Scholar 

  2. W.W.Armstrong, ‘Dependency Structures of Data Base Relationships', Proc. IFIP Congress, Stockholm, Aug 5–10 1974

    Google Scholar 

  3. P.A.Bernstein, J.R.Swenson, D.Tsichritzis, ‘A Unified Approach to Functional Dependencies and Relations', Proc. ACM-SIGMOD Conference, San Jose, Calif., May 14–16, 1975

    Google Scholar 

  4. D.D.Chamberlin, R.F.Boyce, 'sEQUEL: A Structured English Query Language', Proc. ACM-SIGMOD on Data Description, Access and Control, Ann Arbor, Mich., May 1–3, 1974

    Google Scholar 

  5. C.L.Chang, ‘DEDUCE, A Deductive Query Language for Relational Data Bases', Proc. IEEE Joint Workshop on P. Recognition and Artificial Intelligence, Hyannis, Mass., June 1–3, 1976

    Google Scholar 

  6. E.F. Codd, ‘A Relational Model of Data for Large Shared Data Banks', CACM, 13(6), June 1970, pp 377–387

    Google Scholar 

  7. E.F. Codd, ‘Further Normalization of the Data Base Relational Model', Courant Computer Science Symposia Vol. 6, ‘Data Base Systems', New York City, May 24–25 1971, Prentice-Hall, pp 33–64

    Google Scholar 

  8. E.F. Codd, ‘Relational Competeness of Data Base Sublanguages', id. pp 65–98

    Google Scholar 

  9. E.F.Codd, ‘Normalized Data Base Structure: A Brief Tutorial', Proc. 1971 ACM-SIGFIDET Workshop on Data Definition, Access and Control, San Diego, Calif., Nov 11–12 1971

    Google Scholar 

  10. E.F.Codd, ‘A Data Base Sublanguage founded on the Relational Calculus', id.

    Google Scholar 

  11. E.F.Codd, ‘Understanding Relations', continuing series of articles published in FDT, the quarterly bulletin of ACM-SIGMOD, beginning with Vol 5, No 1, June 1973

    Google Scholar 

  12. E.F.Codd, 'seven Steps to Rendezvous with the Casual User', Proc. IFIP TC-2 Working Conference on Data Base Management Systems, Cargese, Corsica, April 1–5, 1974, North-Holland

    Google Scholar 

  13. E.F.Codd, ‘Recent Investigations in Relational Data Base Systems', IFIP 74, Stockholm, Aug 5–10 1974, North-Holland

    Google Scholar 

  14. E.F. Codd, ‘A List of References Pertaining to Relational Data Base Management', IBM Research Laboratory, San Jose, Calif., Aug 19 1975

    Google Scholar 

  15. C.J.Date, ‘An Introduction to Data Base Systems', Addison-Wesley 1975

    Google Scholar 

  16. C. Delobel, R.G.Casey, ‘Decomposition of a Data Base and the Theory of Boolean Switching Functions', IBM Journal of Research and Development, Vol 17, No 5, Sept 1973

    Google Scholar 

  17. K.P.Eswaran, D.D.Chamberlin, ‘Functional Specifications of a Subsystem for Data Base Integrity', Proc. International Conference on Very Large Data Bases, Framingham, Mass., Sept 22–24, 1975

    Google Scholar 

  18. R.Fagin, ‘Relational Data Base Decomposition and Propositional Logic', IBM Reseach Report, San Jose, Calif., June 1976

    Google Scholar 

  19. R.Fagin, ‘Weak Dependencies in a Relational Data Base', IBM Research Report, San Jose, Calif., July–August 1976

    Google Scholar 

  20. R.Fagin, J.Howard, ‘A Complete Axiomatization for Weak Dependencies in a Relational Data Base', IBM Research Report, San Jose, Calif., (to appear)

    Google Scholar 

  21. I.J.Heath ‘Unacceptable File Operations in a Relational Data Base', Proc. 1971 ACM-SIGFIDET Workshop, San Diego (see Ref[9])

    Google Scholar 

  22. J.Mylopoulos et al., ‘TORUS-A Natural Language Understanding System for Data Management', Proc. 4th International Joint Conference on Artificial Intelligence, Tbilisi, Georgia, USSR, 3–8 Sept 1975

    Google Scholar 

  23. J.Mylopoulos et al., 'semantic Networks and the Generation of Context', id.

    Google Scholar 

  24. H.A.Schmid, J.P. Swenson, ‘On the Semantics of the Relational Data Model', Proc. ACM-SIGMOD Conference, San Jose, Calif., May 14–16, 1975

    Google Scholar 

  25. M.M.Zloof, ‘Query by Example', Proc. National Computer Conf., Anaheim, Calif., May 19–22, 1975

    Google Scholar 

  26. M.M.Zloof, ‘Query by Example: Operation on the Transitive Closure', IBM Research Report RC 5526, July 1975

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cadiou, J.M. (1976). On semantic issues in the relational model of data. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_159

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_159

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics