Preview
Unable to display preview. Download preview PDF.
References
S.Abietboul, C.Beeri. On the power of languages for manipulation of complex objecta. INRIA 1987.
V.L. Arlasarov, Ye.A. Dinits. On the theory of instrumental systems. In: System researches. M.: Nauka, 1983, pp. 279–292.
ANSI/X3/SPARC DBMS Framework: Interim report of the Study Group on DBMS. 1977.
W.W.Armstrong. Dependency Structures in Database Relationships. Inform Processing-74, North-Holland, 1974, pp.580–583.
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.
C.Banchilhon. On the completeness of query language for relational data bases. LNCS, 1978, v. 64,pp. 112–123.
Banki dannych. Thesisy dokladov II vsesojuz. konf. Kiev, 1983.
C.Beeri, M.Y.Vardi. Formal systems for tuple and equality generating dependencies. SIAM J. Comput., 1984, v. 13, NI, pp.76–98.
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.
N.Belnap, T.Steel. The logic of questions and answers. Yale Univ.Press, 1976.
Ye.M.Beniaminov. An algebraic approacch to the relational data model. Semiotika, i informatika, 1979, v. 14, pp.44–80.
Ye.M.Beniaminov. An algebreic structure of the relational data bases. Nauchno-tekhn. inform., ser. 2, 1980, N3, pp. 23–25.
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.
V.A.Brudno. Valuations in Incomplete Information Databases. Inform. Syst., 1989, v. 47, pp.389–398.
V.A.Brudno. A DB as a constructive logic model (to appear in ”Automatika i telemekhanika”).
M.A.Casanova. Theory of Functional and Subset Dependencies over Relation Expressions. Inform. Process. Letters, 1983, v.16, pp. 153–166.
A.K.Chandra. D.Harel. Structure and Complexity of Relational Queries. J.Comp. Syst. Sci., 1982, v. 25, pp.99–128.
E.F.Codd. Extending the Database Relational Model to Capture More Meaning. ACM Trans on Datebase Systems, 1979, v. 4, N4, pp. 397–434.
P.M.Cohn. Universal algebra. N.Y.: Harper and Row, 1965.
R.Fagin. Horn clauses and database dependencies. J. of ACM, 1982, v. 29, N3, pp. 678–698.
Feature analysis of generalized data base management systems. CODASYL SYSTEMS COMMITEE, 1971.
V.K.Finn. Approximate inferences and approximate reasorning. Itogy nauki i tekhniki. Theoriya veroyatnostej. V.28, Moscow, VINTTI, 1988, pp.3–84.
S.Ginsburg, R.Hull. Order dependencies in the relational model. Theoret. Comput. Sci., 1983, v.26, pp. 149–195.
A.O.Golosov, M.Sh.Tsalenko. Relational database schemes: normalisation theory and design of normal forms. Prikladnaya informatika, 1983, N2, pp. 92–119.
O.Yu.Gorchinskaya. Join dependencies in database design. Information Sciences, 1989, v.47, N3, pp.373–388.
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.
T.Imielinski, W.Lipski. The relational model of data and cylindric algebras. J. of Comp. and Syst, Sci., 1984, v.28, pp.80–102.
N.Immerman. Relational queries computable in polynomial time. Proc. of 14th ACM symp. on theory of computing. San. Francisco, 1982, pp.147–158.
M.Ye.Iofinova. Updating hierarchical databases by complex forms. LNCS, v.405, 1991, pp.134–145.
L.A.Kalinichenko. Methods and tools of integration of databases with different data models. Moscow, Nauka, 1983.
M.I.Kanovich. Efficient program synthesis; semantics, logic, complexity. LNCS, v.526, 1991, pp. 615–632.
M.I.Kanovich. Efficient logical algorithms of analysis and synthesis of dependencies. Soviet. Math. Dokl., 1985, v.32, N3, pp. 867–871.
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.
E.A.Komissartshik. Restructuring and dependencies in databases. LNCS, 1989, v.364, pp.269–284.
A.B.Livchak. Relational database models and computing in polynomial time. Nauchno-tekhn. inform. ser. 2, 1981, N6, pp.28–29.
A.B.Livchak, A.Ya.Ovsyannikov. On computable queries in relational databases. Nauchno-tekiui. inform., ser. 2, 1983, N8, pp.29–31.
D.Maier. The theory of relational databases. Computer Science Press. 1983.
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.
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.
Ye.A.Neklyudova, M.Sh.Tsalenko. Synthesis of a logical scheme for the relational database. Programmairovanie, 1979, N6, pp.58–68.
A.Ola, G.Ozsoyoglu. A family of incomplete information in relational database models. Proc. of 15th Int. conf. on VLDB, 1989, pp.23–31.
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.
S.V.Petrov. On the axiomatisation of join dependencies. Proc. of 4th Allunion conf. on mathematical logic methods. Yallinn, 1986, pp.151–153.
S.V.Petrov. Finite axiomatisation of languages for representation of system properties. Information sciences, 1989, v.47, N3, pp.267–286.
B.I.Plotkin. Universal algebra, algebraic logic and databases, Moscow, Nauka, 1991.
B.I.Plotkin. Galois theory of databases. In: Algebra, some current trends. Springer, 1988, pp.147–162.
B.I.Plotkin. Halmos (polyadic) algebras on database theory. Colloqnia Mathematika societatis Janos Bolyai, 54, Algebraic Logic, Budapest, 1988, pp. 503–518.
V.N.Red'ko. Foundations of composite programming. Programmirovanie, 1979, N3, pp.3–13.
V.N.Red'ko. Semantic structures of programs. Programmirovanie, 1981, N1, pp.3–19.
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.
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.
L.A.Tenenbaum. Relational decomposition and structural analysis of systems. Information sciences, 1989, v.47, N3, pp.287–338.
L.A.Tenenbaum. Blocks and projections syntesis in relational databases. LNCS, v.364, 1989, pp.367–381.
L.A.Tenenbaum. Indentification of blocks in relational databases. Automatika i telemekkanika, 1990, N8, pp. 173–182 (Russian).
M.Sh.Tsalenko. Modeling semantics in data bases. Moscow, Nauka, 1989.
Ye.P.Yemelchenkov, M.Sh.Tsalenko. Functional dependencies in hierarchical structures of data. LNCS, v.495, pp.258–275.
T.Ye.Yanko. Dialog natural language systems with a data bank. Nauchnotekhn. inform., ser. 2, 1987, N8, pp.16–22.
N.Ye.Yemelyanov. Introduction to DBMS INES. Moscow, Nauka, 1988.
L.A.Zadeh. The concept of a linquistic variable and its application to approximate reasoning. N.Y., Elsevier Publ. Comp., 1973.
A.V.Zamulin. Programing systems for databases and knowledge bases. Novosibirsk, Nauka, 1990.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsalenko, M.S. (1992). Database theory in Russia (1979–1991) (an overview). In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-56039-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56039-5
Online ISBN: 978-3-540-47360-2
eBook Packages: Springer Book Archive