Database Paper Browser

Back to papers

Codd's Theorem for Databases over Semirings

Summary: Extends Codd's theorem to semiring-annotated databases, proving algebra–calculus equivalence in two variants: one for the five basic ops and one for five ops plus division. Models difference via semirings-with-monus and shows division may be inexpressible from the five ops over positive semirings (e.g., bags, tropical). (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
1993
Venue
PODS
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,004 | 30.41%
DOI
10.1145/3767713

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
31 Provenance Semirings 2007 PODS 0.0007857786
2,907 Convergence of Datalog over (Pre-) Semirings 2022 PODS 7.933806e-05
5,992 Evaluating Datalog over Semirings: A Grounding-based Approach 2024 PODS 5.2415551e-05
10,915 Consistency of Relations over Monoids 2024 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers