Name independence and database abstraction in the relational model
In this paper, we have defined two concepts in the context of the relational model for databases. First, we have formalized the notion of internal domains by what we have called name independence. We then proceeded to formally define the abstraction process in a database schema. For an abstraction to be well-defined, we required that the schema be decomposable into independent projections. We have then derived conditions for well-defined abstractions, using the concepts of multi-valued dependency and name independence.
Unable to display preview. Download preview PDF.
- 1.Abrial J.R., Data Semantics, North Holland 1974.Google Scholar
- 2.Armstrong W.W., Dependency Structures of Data Base Relationships, Information Processing 74, North Holland 1974, pp. 580–583.Google Scholar
- 3.Bracchi G., Paolini P., Pelagatti G., Mappings in Data Base Systems, Rapporto Interno n o 76–11, Istituto di Elettrotecnica ed Elettronica del Politecnino di Milano, November 1976.Google Scholar
- 4.Codd E.F., A Relational Model for Large Shared Data Banks, Communications of the ACM, Vol. 13, No 6, June 1970.Google Scholar
- 6.Nissen G.M., Data Structuring in the DDL and Relational Data Model, Proceedings of IFIP TC-2, Working Conference on Data Base Management Systems, Cargese, Corsica, 1–5 April 1974, North Holland 1974.Google Scholar
- 7.Rissanen J., Independent Components of Relations, ACM Transactions on Data Base Systems, Vol. 2, No. 4, December 1977.Google Scholar
- 8.Spyratos N., Bancilhon F., Name Independence in Relational Data Bases, ICMOD Conference 78, Milan, Italy, June 1978.Google Scholar