First Steps in Relational Lattice
Marshall Spight, Vadim Tropashko
Abstract
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.
Create a lesson
Related papers
Compositional Online Learning for Semantic Data Processing Systems
Paweł Liskowski, Fuheng Zhao, Benjamin Han et al.
Incremental Delta-Shapley: A Standalone Runtime for Predicate Attribution on Sliding Windows
Pouya Khani, Ira Assent
Size Bounds for CQs Under Acyclic Constraints
Stefan Mengel, Andrei Romashchenko
IBLTs Measure Before They Decode: Self-Sizing Set Reconciliation from Pre-Peeling Counts
Min Wu, Ji Qi, Chengdui Luo et al.
VoS: Variate Ordering Strategies for Skyline Query Optimization
Abhinav Gorantla, Pratanu Mandal, K. Selçuk Candan et al.
Realistic Counterfactual Explanations via Denial Constraints
Avia Asael, Nave Frost, Amir Gilad et al.