Relational Algebra as non-Distributive Lattice

2005/01/21 by Vadim Tropashko, Tropashko, Vadim · 2 citations
Computer Science · #Advanced Algebra and Logic #Cognitive Science and Mapping #Logic, Reasoning, and Knowledge #cs.DB

paper · pdf · doi:10.48550/arxiv.cs/0501053

9 pages

arxiv created 2005/02/04 · arxiv updated 2009/12/01

Abstract

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

Cited by

• Relational Lattice Foundation for Algebraic Logic
• The quasiequational theory of relational lattices, in the pure lattice signature (embeddability into relational lattices is undecidable)

Related

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