Extending the database relational model to capture more meaning

  title={Extending the database relational model to capture more meaning},
  author={E. F. Codd},
  journal={ACM Transactions on Database Systems (TODS)},
  pages={397 - 434}
  • E. Codd
  • Published 1 December 1979
  • Computer Science
  • ACM Transactions on Database Systems (TODS)
During the last three or four years several investigators have been exploring “semantic models” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can behave more intelligently. Two major thrusts are clear. (1) the search for meaningful units that are as small as possible—atomic semantics; (2) the search for meaningful units that are larger than the… 

Figures from this paper

Capturing More Meaning in Databases

  • D. Maier
  • Computer Science
    J. Manag. Inf. Syst.
  • 1984
This work explores the problem of making databases selfdescriptive and considers several semantic data models, which are formal languages for conceptual data description, and how a semantic description can be linked to the objects in a database.

Understanding semantic relationships

  • V. Storey
  • Computer Science
    The VLDB Journal
  • 2005
This article explores some of the lesser-recognized semantic relationships and discusses both how they could be captured, either manually or by using an automated tool, and their impact on database design.

A Universal Relation Data Model with Semantic Abstraction

A new data model that incorporates standard concepts from semantic data models such as entities, aggregations, and ISA hierarchies is introduced and it is shown how nonnavigational queries and updates can be interpreted in this model.

Feature structures and database theory

The goal of this paper is to provide a database model for sets of feature structures, thus bridging the gap between the two fields, feature-structure theory and database theory, both of which are well-developed and well-formalized, but seem to have evolved in relatively separate communities.

An implementation of GEM: supporting a semantic data model on a relational back-end.

A DBMS consisting of a user-friendly front-end, supporting the GEM semantic data model and query language under the UNIX time-sharing system, and a dedicated back-end processor providing efficient support for database transactions, concurrency control and recovery is described.

IFO: a formal semantic database model

A new, formally defined database model is introduced which combines fundamental principles of "semantic" database modeling in a coherent fashion and can serve as the foundation for a theoretical investigation into a wide variety of fundamental issues concerning the logical representation of data in databases.

Toward the Next Generation of Data Modeling Tools

The Update Protocol Model is described, a formal language for the expression of database update semantics that has been used primarily to capture and communicate in a precise and uniform notation the plethora of database semantics described by a variety of "fourth generation" models.

Incorporating computed relations in relational databases

The relational algebra of the relational model of databases is unable to express certain relations or operations of interest (for instance, the transitive closure of a relation), as Aho and Ullman



On the semantics of the relational data model

A data model is discussed that takes into account basic semantic properties that object types and relationships among them apparently have in the real world, and permits us to analyze the ideas behind the relational theory more precisely, in particular the meaning of functional dependency and normalization.

Null values in data base management a denotational semantics approach

The many-valued logic approach to the formal treatment of null values in data bases based on the Denotational Semantics Theory and an algorithm for the evaluation of simple queries is presented.

On semantic issues connected with incomplete information databases

  • W. Lipski
  • Computer Science
    ACM Trans. Database Syst.
  • 1979
This work emphasizes the distinction between two different interpretations of the query language—the external one, which refers the queries directly to the real world modeled in an incomplete way by the system, and the internal one, under which the queries refer to the system's information about this world, rather than to the world itself.

Understanding relations

In this case a strong argument against SUCh a step is that either it destroys the symmetric exploitation property of the replaced relations or else it requires an absurdly redundant collection of-~unc~ons.

Database abstractions: aggregation

It is suggested that aggregate types, and other types which support real-world abstractions without introducing implementation detail, should be incorporated into programming languages.

A Sophisticate's Introduction to Database Normalization Theory

Database abstractions: aggregation and generalization

A triggering mechanism for automatically maintaining these invariants during update operations is proposed, and a simple mapping of aggregation/generalization hierarchies onto owner-coupled set structures is given.

Generalized joins

This short note presents generalizations of the join operation which are defined in such a manner that no information is lost in the join, i.e. that the operand relations can be recovered from the join.

A relational model of data for large shared data banks

A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.

Multivalued dependencies and a new normal form for relational databases

It is shown that every relation schema can be decomposed into a family of relation schemata in fourth normal form without loss of information (that is, the original relation can be obtained from the new relations by taking joins).