Data Management

Mnesors for Databases

Free registration required

Executive Summary

The authors add commutatively to axioms defining mnesors and substitute a bitrop for the lattice. They show that it can be applied to relational database querying: set union, intersection and selection are redefined only from the mnesor addition and the granular multiplication. Union-compatibility is not required. Their purpose is to find a mathematical model for information similar to abstract vectors. They first define a structure called a bitrop which plays the role of the field for vectors, and then they will define semimodules over bitrops. The resulting two-sorted structure forms an interesting linear algebra because it mixes properties of lattices (boolean for example) with properties of vectors: the addition of mnesors aggregates information and the external multiplication selects information.

  • Format: PDF
  • Size: 130.4 KB