Codd's theorem, the equivalence of relational algebra and relational calculus, is extended to semiring-annotated databases, with a proof that division is not expressible from the five basic operations over bag databases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Codd's Theorem for Databases over Semirings
Codd's theorem, the equivalence of relational algebra and relational calculus, is extended to semiring-annotated databases, with a proof that division is not expressible from the five basic operations over bag databases.