2006/03/10 by Marshall Spight, Spight, Marshall, Vadim Tropashko +1
Computer Science · #Databases (cs.DB) #FOS: Computer and information sciences #cs.DB
paper · pdf · doi:10.48550/arxiv.cs/0603044
11 pages, 3 figures
arxiv created 2006/03/15 · arxiv updated 2009/12/01
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.