Email this article Algebraization of Inferring Functional Dependences in Relational Databases
- Authors: Pomortsev L.A.1,2, Tsurkov V.I.1,2
-
Affiliations:
- Moscow Institute of Aviation (National Research University)
- Dorodnicyn Computing Center, Federal Research Center Computer Science, Russian Academy of Sciences
- Issue: Vol 58, No 2 (2019)
- Pages: 212-228
- Section: Artificial Intelligence
- URL: https://journals.rcsi.science/1064-2307/article/view/220326
- DOI: https://doi.org/10.1134/S1064230719020151
- ID: 220326
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
L. A. Pomortsev
Moscow Institute of Aviation (National Research University); Dorodnicyn Computing Center, Federal Research Center Computer Science,Russian Academy of Sciences
Author for correspondence.
Email: brickfactory.org@mail.ru
Russian Federation, Moscow, 125993; Moscow, 119333
V. I. Tsurkov
Moscow Institute of Aviation (National Research University); Dorodnicyn Computing Center, Federal Research Center Computer Science,Russian Academy of Sciences
Author for correspondence.
Email: tsur@ccas.ru
Russian Federation, Moscow, 125993; Moscow, 119333
