Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two directions. First, we uncover a pair of complementary lattice operators, and organize the model into a bilattice of four operations and four distinguished constants. We take a notice a peculiar way bilattice symmetry is broken. Then, we give axiomatic introduction of unary negation operation and prove several laws, including double negation and De Morgan. Next we reduce the model back to two basic binary operations and twelve axioms, and exhibit a convincing argument that the resulting system is complete in model-theoretic sense. The final parts of the paper casts relational lattice perspective onto database dependency theory and into cylindric algebras.
[1]
Matthew L. Ginsberg.
Bilattices and Modal Operators
,
1990,
J. Log. Comput..
[2]
D. Inform,et al.
First Steps in Pointfree Functional Dependency Theory
,
2005
.
[3]
Vadim Tropashko,et al.
First Steps in Relational Lattice
,
2006,
ArXiv.
[4]
A. Tarski,et al.
Cylindric Algebras. Part II
,
1988
.
[5]
C. J. Date,et al.
Foundation for Future Database Systems: The Third Manifesto
,
2000
.
[6]
Vadim Tropashko,et al.
Relational Lattice Axioms
,
2008,
ArXiv.
[7]
Vadim Tropashko,et al.
Relational Algebra as non-Distributive Lattice
,
2005,
ArXiv.