Difference between revisions of "Relational model"

Revision as of 10:11, 2 September 2015

The relational model for database management is a database model based on first-order predicate logic, first formulated and proposed in 1969 by Edgar F. Codd.

Description

In the relational model of a database, all data is represented in terms of tuples, grouped into relations.

A database organized in terms of the relational model is a relational database.

Purpose

The purpose of the relational model is to provide a declarative programming method for specifying data and queries: users directly state what information the database contains and what information they want from it, and let the database management system software take care of describing data structures for storing the data and retrieval procedures for answering queries.

Implementations

Most relational databases use the SQL data definition and query language. These systems implement what can be regarded as an engineering approximation to the relational model.

Correspondences between SQL and the relational model:

• A table in an SQL database schema corresponds to a predicate variable.
• The contents of a table to a relation
• Key constraints, other constraints, and SQL queries correspond to predicates

However, SQL databases deviate from the relational model in many details, and Codd fiercely argued against deviations that compromise the original principles.

See also

• Computer science
• Codd's 12 rules
• Data (computing)
• Database
• Declarative programming

External links

• Relational model @ Wikipedia