Mnesors for databases
Logic in Computer Science
2009-12-15 v4
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.
Keywords
Cite
@article{arxiv.0805.2179,
title = {Mnesors for databases},
author = {Gilles Champenois},
journal= {arXiv preprint arXiv:0805.2179},
year = {2009}
}