Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Codd's_theorem> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Codd's_theorem abstract "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 had been known to logicians since the late 1940s.Query languages that are equivalent in expressive power to relational algebra were 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). Codd's theorem also doesn't consider SQL nulls and the three-valued logic they entail; the logical treatment of nulls remains mired in controversy. (For recent work extending Codd's theorem in this direction see the 2012 paper of Franconi and Tessaris.) Additionally, SQL allows duplicate rows (has multiset semantics.) Nevertheless, relational completeness constitutes an important yardstick by which the expressive power of query languages can be compared.".
- Codd's_theorem wikiPageExternalLink dbt03.pdf.
- Codd's_theorem wikiPageID "18900634".
- Codd's_theorem wikiPageRevisionID "550652991".
- Codd's_theorem hasPhotoCollection Codd's_theorem.
- Codd's_theorem subject Category:Relational_model.
- Codd's_theorem subject Category:Theorems_in_the_foundations_of_mathematics.
- Codd's_theorem type Abstraction100002137.
- Codd's_theorem type Communication100033020.
- Codd's_theorem type Message106598915.
- Codd's_theorem type Proposition106750804.
- Codd's_theorem type Statement106722453.
- Codd's_theorem type Theorem106752293.
- Codd's_theorem type TheoremsInTheFoundationsOfMathematics.
- Codd's_theorem comment "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's_theorem label "Codd's theorem".
- Codd's_theorem sameAs Théorème_de_Codd.
- Codd's_theorem sameAs m.04jf18n.
- Codd's_theorem sameAs Q5139948.
- Codd's_theorem sameAs Q5139948.
- Codd's_theorem sameAs Codd's_theorem.
- Codd's_theorem wasDerivedFrom Codd's_theorem?oldid=550652991.
- Codd's_theorem isPrimaryTopicOf Codd's_theorem.