Advertisement

Algebraization of Inferring Functional Dependences in Relational Databases

  • L. A. PomortsevEmail author
  • V. I. TsurkovEmail author
ARTIFICIAL INTELLIGENCE
  • 5 Downloads

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.

Notes

REFERENCES

  1. 1.
    E. F. Codd, “A relational model of data for large shared data banks,” Comm. ACM 13, 377–387 (1970).CrossRefzbMATHGoogle Scholar
  2. 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. 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. 4.
    J. Ullman, A PASCAL Database (Clarendon, Oxford, 1936).Google Scholar
  5. 5.
    L. A. Pomortsev, “Algebraic interpretation of derivation axioms completeness,” Fundam. Prikl. Mat. 8, 195–219 (2002).MathSciNetzbMATHGoogle Scholar
  6. 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
  7. 7.
    D. Maier, Theory of Relational Databases (Computer Science, New York, 1983).zbMATHGoogle Scholar
  8. 8.
    C. J. Date, An Introduction to Database Systems (Pearson, New York, 2003).zbMATHGoogle Scholar
  9. 9.
    F. Hausdorff, Set Theory (Am. Math. Soc., Providence, 2005).zbMATHGoogle Scholar
  10. 10.
    V. A. Emelichev, O. I. Mel’nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lectures on Graph Theory (Nauka, Moscow, 1990) [in Russian].zbMATHGoogle Scholar
  11. 11.
    P. Cohn, Universal Algebra (Springer, Dordrecht, Holland, 1981).CrossRefzbMATHGoogle Scholar
  12. 12.
    A. G. Kurosh, Lectures on General Algebra (Fizmatgiz, Moscow, 1962) [in Russian].Google Scholar
  13. 13.
    L. A. Pomortsev, “Calculation of the moments of the order statistics of successive sums of symmetrically dependent random variables,” Tr. Mosk. Mat. Ob-va 46, 201–242 (1983).MathSciNetzbMATHGoogle Scholar
  14. 14.
    L. A. Pomortsev, “Combinatorial symmetric analysis of multidimensional random walks,” Diskret. Mat. 3 (1), 21–41 (1991).MathSciNetzbMATHGoogle Scholar
  15. 15.
    E. Szpilrajn, “Sur l’extension de l’ordre partiel,” Fundam. Math. 16, 386–389 (1930).CrossRefzbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2019

Authors and Affiliations

  1. 1.Moscow Institute of Aviation (National Research University)MoscowRussia
  2. 2.Dorodnicyn Computing Center, Federal Research Center Computer Science, Russian Academy of SciencesMoscowRussia

Personalised recommendations