Jump to content

Codd's theorem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Cdrdata (talk | contribs) at 06:01, 31 August 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Codd's theorem states that relational algebra and the domain-independent relational calculus queries, two well-known foundational query languages for the relational model, are precisely equivalent in expressive power. That is, a database query can be formulated in one language if and only if it can be expressed in the other.

The theorem is named after Edgar F. Codd, the father of the relational model for database management.

The domain independent relational calculus queries are precisely those relational calculus queries that are invariant under choosing domains of values beyond those appearing in the database itself. That is, queries that may return different results for different domains are excluded. An example of such a forbidden query is the query "select all tuples other than those occurring in relation R", where R is a relation in the database. Assuming different domains, i.e., sets of atomic data items from which tuples can be constructed, this query returns different results and thus is clearly not domain independent.

Codd's Theorem is notable since it establishes the equivalence of two syntactically quite dissimilar languages: relational algebra is an imperative, variable-free language, while relational calculus is a logical language with variables and quantification.

Relational calculus is essentially equivalent to first-order logic, and indeed, Codd's Theorem was previously known to logicians since the late 1940s[1][2].

Query languages that are equivalent in expressive power to relational algebra where called relationally complete by Codd. By Codd's Theorem, this includes relational calculus. Relational completeness clearly does not imply that any interesting database query can be expressed in relationally complete languages. Well-known examples of inexpressible queries include simple aggregations (counting tuples, or summing up values occurring in tuples, which are operations expressible in SQL but not in relational algebra) and computing the transitive closure of a graph given by its binary edge relation (see also expressive power). Nevertheless, relational completeness constitutes an important yardstick by which the expressive power of query languages can be compared.

Footnotes

  1. ^ L.H. Chin and A. Tarski. Remarks on Projective Algebras. Bulletin of the AMS, 54:80-81, 1948.
  2. ^ A. Tarski and F.B. Thompson. Some general properties of cylindric algebras. Bulletin of the AMS, 58:65, 1952.

References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Codd%27s_theorem&oldid=235328090"