Database Paper Browser

Back to papers

When Data Dependencies over SQL Tables Meet the Logics of Paradox and S-3

Summary: Reduces implication of FDs/MVDs over SQL tables with nulls to paraconsistent logics: without NOT NULLs equivalent to propositional fragments of Priest’s Logic of Paradox. Extends to Boolean deps via S-3 (parametrized by NOT NULL attributes), exposing NOT NULLs as a tunable tractability/expressiveness knob. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1530
Venue
PODS
Year
2010
Pagerank
4.1945683e-05
Overall Rank
12,219 | 15.00%
DOI
-

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 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,854 SQL Schema Design: Foundations, Normal Forms, and Normalization 2016 SIGMOD 4.1945683e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers