High level definition of abstract domains in a relational data base system

https://doi.org/10.1016/0096-0551(77)90008-XGet rights and content

Abstract

A relational data base is herein defined as a collection of normalized relations (relations in first normal form) and a collection of domains. A normalized relation may be viewed as a table, wherein each row of the table corresponds to a tuple of the relation, and the entries in a given column belong to the set of values constituting the domain underlying that column. The domains of a data base have an abstract existence apart from the data base relations.

The data base also includes various types of semantic integrity rules, which specify additional properties of the data in the data base. One such type of semantic integrity rule is the domain definition. A domain definition includes the precise description of the set of values (objects) constituting the domain. In a normalized data base, all domains are sets of atomic data values. A domain definition also includes a specification of the ordering on the values in a domain, for comparability purposes. In addition, a domain definition contains a specification of the action that is to occur if an attempt is made to violate the restriction that every entry in each column of a relation must be from the underlying domain of that column.

A nonprocedural language permitting the high level expression of domain definitions is defined. Language details and examples are presented, and the syntax and informal semantics of the domain definition language are given. This approach to domain definition is analyzed in terms of its impact on other aspects of data base semantic integrity. The relationship with the data base system in general is outlined. An analysis of intradomain and interdomain comparability is included. An introduction to relevant implementation issues is also presented. Emphasis is placed on a general approach to implementation and implementation techniques, rather than on a specific system.

References (16)

  • R.F. Boyce et al.

    Using a structured English query language as a data definition facility

    IBM Res. Rpt RJ1318

    (1973)
  • D.D. Chamberlin et al.

    SEQUEL: a structured English query language

  • D.D. Chamberlin et al.

    Views, authorization, and locking in a relational data base system

  • E.F. Codd

    A relational model for large shared data banks

    Comm. ACM

    (1970)
  • E.F. Codd

    Further normalization of the data base relational model

  • E.F. Codd

    Normalized data base structure: A brief tutorial

  • E.F. Codd

    Recent investigations in relational data base systems

  • K.P. Eswaran et al.

    Functional specifications of a subsystem for data base integrity

There are more references available in the full text version of this article.

Cited by (7)

View all citing articles on Scopus

This research was sponsored, in part, by the IBM Research Laboratory, San Jose CA. A preliminary version of this paper was presented at the ACM SIGPLAN-SIGMOD Conference on Data: Abstraction, Definition, and Structure, 22–24 March 1976, Salt Lake City UT.

View full text