Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results include Spight distributivity criteria and its applications to query transformations.
Relational lattice operations REF , which reduces the five standard relational operators to generalized union ( ) and natural join ( ).
First Steps in Relational Lattice
ArXiv
ArXiv
Computer Science