Algebraization of Inferring Functional Dependences in Relational Databases

详细

The paper considers a closed automaton with six not more than two-address instructions called inference axioms. Its purpose is to transform the so-called functional dependences over an arbitrary finite set R called a scheme. We establish the possibility of a functionally equivalent replacement of algorithms for inferring functional dependences by algebraic expressions with one of the binary algebraic operations ▶ and ▷ with the addition of very simple nullary and unary operations (instructions) to them, which together comprise the universal D-algebra.