An axiomatics for multivalued dependences in tabular databases

Authors

  • V.N. Redko
  • D.B. Bui
  • А.V. Puzikova

DOI:

https://doi.org/10.15407/dopovidi2015.06.024

Keywords:

completeness criteria, completeness of axiomatic system, functional dependencies, multivalued dependences, table databases

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.

Downloads

Download data is not yet available.

References

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).

Beeri C., Fagin, R., Howard J. In Proceedings of the ACM-SIGMOD Conf., August 3–5, 1977, Toronto, Canada: 47–61.

Lyndon R. Notes on Logic. D. Van Nostrand, Princeton, 1966.

Skornyakov L.A. Elementy teorii struktur, Moskva: Nauka, 1982 (in Russian).

Maier D. The theory of relational databases, Computer Science Press, 1983.

Downloads

Published

04.02.2025

How to Cite

Redko, V., Bui, D., & Puzikova А. (2025). An axiomatics for multivalued dependences in tabular databases . Reports of the National Academy of Sciences of Ukraine, (6), 24–29. https://doi.org/10.15407/dopovidi2015.06.024

Issue

No. 6 (2015): Reports of the National Academy of Sciences of Ukraine

Section

Information Science and Cybernetics

License

Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.