Relational Completeness of Data Base Sublanguages.¶
Codd, E. F. (1972). Relational Completeness of Data Base Sublanguages. Database Systems.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Quantifier
- In database queries existence, universal, and aggregate-count operators are quantifiers over rows, and query semantics live or die by quantifier scope.
This sourceDefines relational calculus including existential and universal quantification over tuples — quantifiers as the basis of query semantics.
Supported in partVerified against the work's full text
Codd defines a relational calculus with existential and universal quantifiers over tuple variables and treats counting as an add-on, so it backs the quantifier part but not "aggregate-count".
“Later we shall see that division provides an algebraic counterpart to the universal quantifier.”
- In database queries existence, universal, and aggregate-count operators are quantifiers over rows, and query semantics live or die by quantifier scope.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:25eaf635c4cb · see in the full table