An axiomatics for multivalued dependences in tabular databases

1Redko, VN, 1Bui, DB, 1Puzikova, AV
1Taras Shevchenko National University of Kyiv
Dopov. Nac. akad. nauk Ukr. 2015, 6:24-29
https://doi.org/10.15407/dopovidi2015.06.024
Section: Information Science and Cybernetics
Language: Ukrainian
Abstract: 

Axiomatics for multivalued dependences in table databases and for functional and multivalued dependences is considered. The completeness of these axiomatic systems is established in terms of the coincidence of syntactic and semantic consequence relations. The completeness criteria for these axiomatic systems are formulated in terms of cardinalities of the universal domain and the set of attributes.

Keywords: completeness criteria, completeness of axiomatic system, functional dependencies, multivalued dependences, table databases
References: 
  1. Redko V.N., Brona Yu. J., Buy D.B., Polyakov S.A. Reliatsiini bazy danykh: tablychni alhebry ta SQL-podibni movy, Kyiv: Akademperiodyka, 2001 (in Ukrainian).
  2. Beeri C., Fagin, R., Howard J. In Proceedings of the ACM-SIGMOD Conf., August 3–5, 1977, Toronto, Canada: 47–61.
  3. Lyndon R. Notes on Logic. D. Van Nostrand, Princeton, 1966.
  4. Skornyakov L.A. Elementy teorii struktur, Moskva: Nauka, 1982 (in Russian).
  5. Maier D. The theory of relational databases, Computer Science Press, 1983.