Algebraization of Inferring Functional Dependences in Relational Databases
- 5 Downloads
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.
- 2.E. F. Codd, “Extending the database relational model to capture more meaning,” ACM Trans. Database Syst., No. 4, 397–434 (1979).Google Scholar
- 3.I. J. Heath, “Unacceptable file operation in relational database,” in Proceedings of the 1971 ACM SIGFIDET Workshop on Data Description, Access and Control, San Diego, California, 1971.Google Scholar
- 4.J. Ullman, A PASCAL Database (Clarendon, Oxford, 1936).Google Scholar
- 6.L. A. Pomortsev, “Algebras of functional dependencies in the theory of relational databases,” Tr. Inst. Sist. Anal. RAN, Dinam. Neodn. Sist. 29 (11), 169–183 (2007).Google Scholar
- 12.A. G. Kurosh, Lectures on General Algebra (Fizmatgiz, Moscow, 1962) [in Russian].Google Scholar