Relational Lattice Axioms

2008/07/24 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.0807.3795

10 pages, 4 figures

arxiv created 2008/07/24 · arxiv updated 2009/12/01

Abstract

Relational lattice is a formal mathematical model for Relational algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. We continue to investigate Relational lattice properties with emphasis onto axiomatic definition. New results include additional axioms, equational definition for set difference (more generally anti-join), and case study demonstrating application of the relational lattice theory for query transformations.

Related

• First Steps in Relational Lattice
• Relational Lattice Foundation for Algebraic Logic
• Relational Algebra as non-Distributive Lattice
• Relational lattices via duality
• The equational theory of the natural join and inner union is decidable