TL;DR
This paper introduces a novel algebraic framework using mnesors and bitrops to redefine relational database operations, enabling more flexible querying without the need for union-compatibility.
Contribution
It extends the algebraic structure of mnesors with commutativity and replaces the lattice with a bitrop, applying these to database querying.
Findings
Redefines set union, intersection, and selection using mnesor addition and granular multiplication.
Eliminates the need for union-compatibility in database operations.
Provides a new algebraic foundation for relational databases.
Abstract
We add commutativity to axioms defining mnesors and substitute a bitrop for the lattice. We show that it can be applied to relational database querying: set union, intersection and selection are redifined only from the mnesor addition and the granular multiplication. Union-compatibility is not required.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Data Management and Algorithms