Database theory in Russia (1979–1991) (an overview)

  • M. Sh. Tsalenko
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 646)


Boolean Function Functional Dependency Query Language Integrity Constraint Relational Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S.Abietboul, C.Beeri. On the power of languages for manipulation of complex objecta. INRIA 1987.Google Scholar
  2. [2]
    V.L. Arlasarov, Ye.A. Dinits. On the theory of instrumental systems. In: System researches. M.: Nauka, 1983, pp. 279–292.Google Scholar
  3. [3]
    ANSI/X3/SPARC DBMS Framework: Interim report of the Study Group on DBMS. 1977.Google Scholar
  4. [4]
    W.W.Armstrong. Dependency Structures in Database Relationships. Inform Processing-74, North-Holland, 1974, pp.580–583.Google Scholar
  5. [5]
    M.A. Babushkin, M.Sh. Tsalenko. The relational data model with incomplete information: non-procedural query language and its interpretation (in Russian). In: Thesiay dokl. Vsesojuz. konferencii po iskusstvennomu intellectu. Pereslavl-Zalesskij, 1988, pp.326–332.Google Scholar
  6. [6]
    C.Banchilhon. On the completeness of query language for relational data bases. LNCS, 1978, v. 64,pp. 112–123.Google Scholar
  7. [7]
    Banki dannych. Thesisy dokladov II vsesojuz. konf. Kiev, 1983.Google Scholar
  8. [8]
    C.Beeri, M.Y.Vardi. Formal systems for tuple and equality generating dependencies. SIAM J. Comput., 1984, v. 13, NI, pp.76–98.Google Scholar
  9. [9]
    C.Beeri, M.Doud, R.Fagin, R.Statman. On the structure of Armstrong Relations For Functional Dependencies. J. of ACM, 1984, v. 34, N1, pp.30–46.Google Scholar
  10. [10]
    N.Belnap, T.Steel. The logic of questions and answers. Yale Univ.Press, 1976.Google Scholar
  11. [11]
    Ye.M.Beniaminov. An algebraic approacch to the relational data model. Semiotika, i informatika, 1979, v. 14, pp.44–80.Google Scholar
  12. [12]
    Ye.M.Beniaminov. An algebreic structure of the relational data bases. Nauchno-tekhn. inform., ser. 2, 1980, N3, pp. 23–25.Google Scholar
  13. [13]
    Ye.M.Beniaminov. On the role of symmetry in the relational data model and logical structures. Nauckno-tekn. inform., ser 2, 1984, N5, pp.17–25.Google Scholar
  14. [14]
    V.A.Brudno. Valuations in Incomplete Information Databases. Inform. Syst., 1989, v. 47, pp.389–398.Google Scholar
  15. [15]
    V.A.Brudno. A DB as a constructive logic model (to appear in ”Automatika i telemekhanika”).Google Scholar
  16. [16]
    M.A.Casanova. Theory of Functional and Subset Dependencies over Relation Expressions. Inform. Process. Letters, 1983, v.16, pp. 153–166.Google Scholar
  17. [17]
    A.K.Chandra. D.Harel. Structure and Complexity of Relational Queries. J.Comp. Syst. Sci., 1982, v. 25, pp.99–128.Google Scholar
  18. [18]
    E.F.Codd. Extending the Database Relational Model to Capture More Meaning. ACM Trans on Datebase Systems, 1979, v. 4, N4, pp. 397–434.Google Scholar
  19. [19]
    P.M.Cohn. Universal algebra. N.Y.: Harper and Row, 1965.Google Scholar
  20. [20]
    R.Fagin. Horn clauses and database dependencies. J. of ACM, 1982, v. 29, N3, pp. 678–698.Google Scholar
  21. [21]
    Feature analysis of generalized data base management systems. CODASYL SYSTEMS COMMITEE, 1971.Google Scholar
  22. [22]
    V.K.Finn. Approximate inferences and approximate reasorning. Itogy nauki i tekhniki. Theoriya veroyatnostej. V.28, Moscow, VINTTI, 1988, pp.3–84.Google Scholar
  23. [23]
    S.Ginsburg, R.Hull. Order dependencies in the relational model. Theoret. Comput. Sci., 1983, v.26, pp. 149–195.Google Scholar
  24. [24]
    A.O.Golosov, M.Sh.Tsalenko. Relational database schemes: normalisation theory and design of normal forms. Prikladnaya informatika, 1983, N2, pp. 92–119.Google Scholar
  25. [25]
    O.Yu.Gorchinskaya. Join dependencies in database design. Information Sciences, 1989, v.47, N3, pp.373–388.Google Scholar
  26. [26]
    L.A.Gusev, S.V.Petrov, L.A.Tenenbaum. Relations, dependencies and some problems of system theory. Information sciences, 1989, v.47, N3, pp. 339–372.Google Scholar
  27. [27]
    T.Imielinski, W.Lipski. The relational model of data and cylindric algebras. J. of Comp. and Syst, Sci., 1984, v.28, pp.80–102.Google Scholar
  28. [28]
    N.Immerman. Relational queries computable in polynomial time. Proc. of 14th ACM symp. on theory of computing. San. Francisco, 1982, pp.147–158.Google Scholar
  29. [29]
    M.Ye.Iofinova. Updating hierarchical databases by complex forms. LNCS, v.405, 1991, pp.134–145.Google Scholar
  30. [30]
    L.A.Kalinichenko. Methods and tools of integration of databases with different data models. Moscow, Nauka, 1983.Google Scholar
  31. [31]
    M.I.Kanovich. Efficient program synthesis; semantics, logic, complexity. LNCS, v.526, 1991, pp. 615–632.Google Scholar
  32. [32]
    M.I.Kanovich. Efficient logical algorithms of analysis and synthesis of dependencies. Soviet. Math. Dokl., 1985, v.32, N3, pp. 867–871.Google Scholar
  33. [33]
    M.R.Kogalovskij, V.V.Kogutovskij. Mechanisms of conceptual level DBMS MUSSON. In: Tekhnika realisazii, mnogourovnevych system upravleniya basami dannych. Moscow, 1982, pp.20–57.Google Scholar
  34. [34]
    E.A.Komissartshik. Restructuring and dependencies in databases. LNCS, 1989, v.364, pp.269–284.Google Scholar
  35. [35]
    A.B.Livchak. Relational database models and computing in polynomial time. Nauchno-tekhn. inform. ser. 2, 1981, N6, pp.28–29.Google Scholar
  36. [36]
    A.B.Livchak, A.Ya.Ovsyannikov. On computable queries in relational databases. Nauchno-tekiui. inform., ser. 2, 1983, N8, pp.29–31.Google Scholar
  37. [37]
    D.Maier. The theory of relational databases. Computer Science Press. 1983.Google Scholar
  38. [38]
    T.A.Malyuta, V.V.Pasichnik, A.A.Stogniy. Meana for management of relational fuzzy databases — way to merging of systems of databases and knowledge bases. LNCS, 1989, v.364, pp.337–346.Google Scholar
  39. [39]
    M.A.Mikheyenkova, V.K.Finn, Concerning a class of expert systems with incomplete information. Izv.Acad.Nauk SSSR, Tekhn. cybernetika., 1986, N5, pp. 82–103.Google Scholar
  40. [40]
    Ye.A.Neklyudova, M.Sh.Tsalenko. Synthesis of a logical scheme for the relational database. Programmairovanie, 1979, N6, pp.58–68.Google Scholar
  41. [41]
    A.Ola, G.Ozsoyoglu. A family of incomplete information in relational database models. Proc. of 15th Int. conf. on VLDB, 1989, pp.23–31.Google Scholar
  42. [42]
    V.A.Parfenov, M.Sh.Tsalenko, Armstrong relations for functional and multivalued dependencies. In: Thesisy dokl. of All-union konf. “Semiotic aspects of formalisation of intellectual activity”, Borzomi, 1988, pp.Google Scholar
  43. [43]
    S.V.Petrov. On the axiomatisation of join dependencies. Proc. of 4th Allunion conf. on mathematical logic methods. Yallinn, 1986, pp.151–153.Google Scholar
  44. [44]
    S.V.Petrov. Finite axiomatisation of languages for representation of system properties. Information sciences, 1989, v.47, N3, pp.267–286.Google Scholar
  45. [45]
    B.I.Plotkin. Universal algebra, algebraic logic and databases, Moscow, Nauka, 1991.Google Scholar
  46. [46]
    B.I.Plotkin. Galois theory of databases. In: Algebra, some current trends. Springer, 1988, pp.147–162.Google Scholar
  47. [47]
    B.I.Plotkin. Halmos (polyadic) algebras on database theory. Colloqnia Mathematika societatis Janos Bolyai, 54, Algebraic Logic, Budapest, 1988, pp. 503–518.Google Scholar
  48. [48]
    V.N.Red'ko. Foundations of composite programming. Programmirovanie, 1979, N3, pp.3–13.Google Scholar
  49. [49]
    V.N.Red'ko. Semantic structures of programs. Programmirovanie, 1981, N1, pp.3–19.Google Scholar
  50. [50]
    M.Roth, H.Korth, A.Silberschatz. Extended Algebra and Calculus for Nested Relational Databases. ACM Trans. on Database Systems, 1988, v. 13, N4, pp. 389–417.CrossRefGoogle Scholar
  51. [51]
    V.Yu.Sazonov. Hereditarily-finite sets with attributes, databases and polynomial-time computability. In:Actes Preliminaires du Symposium Franco-Sovietique INFORMATIKA-91, INRIA, 1991, pp.113–132.Google Scholar
  52. [52]
    L.A.Tenenbaum. Relational decomposition and structural analysis of systems. Information sciences, 1989, v.47, N3, pp.287–338.Google Scholar
  53. [53]
    L.A.Tenenbaum. Blocks and projections syntesis in relational databases. LNCS, v.364, 1989, pp.367–381.Google Scholar
  54. [54]
    L.A.Tenenbaum. Indentification of blocks in relational databases. Automatika i telemekkanika, 1990, N8, pp. 173–182 (Russian).Google Scholar
  55. [55]
    M.Sh.Tsalenko. Modeling semantics in data bases. Moscow, Nauka, 1989.Google Scholar
  56. [56]
    Ye.P.Yemelchenkov, M.Sh.Tsalenko. Functional dependencies in hierarchical structures of data. LNCS, v.495, pp.258–275.Google Scholar
  57. [57]
    T.Ye.Yanko. Dialog natural language systems with a data bank. Nauchnotekhn. inform., ser. 2, 1987, N8, pp.16–22.Google Scholar
  58. [58]
    N.Ye.Yemelyanov. Introduction to DBMS INES. Moscow, Nauka, 1988.Google Scholar
  59. [59]
    L.A.Zadeh. The concept of a linquistic variable and its application to approximate reasoning. N.Y., Elsevier Publ. Comp., 1973.Google Scholar
  60. [60]
    A.V.Zamulin. Programing systems for databases and knowledge bases. Novosibirsk, Nauka, 1990.Google Scholar
  61. [61]
    G.Zvi. An Almost Linear Time Algorithm for Computing a Dependency Basis in a Relational Database. J. of ACM, 1982, v.29, N1, pp. 96–102.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • M. Sh. Tsalenko
    • 1
  1. 1.Russian State Humanitarian UniversityMoscow

Personalised recommendations