Abstract: Abstract: In this paper, we consider a generalization of the derivation rules for join dependencies, which are used in designing a database scheme that satisfies the requirements of the fifth normal form. Attempts to construct systems of axioms of such dependencies based on derivation rules were made in previous works devoted to this problem. However, while the substantiation of the consistency (soundness) of the obtained axioms does not cause difficulties, then a satisfactory solution to prove the completeness in the general case was not obtained. First of all, this is due to the limitations of the derivation rules themselves. Here, we focus on two original axiom systems presented in the Sciore and Malvestuto works. For join dependencies, a system of rules that generalizes existing systems and at the same time has fewer restrictions is obtained. A proof of the derivability of known systems of axioms from the presented derivation rules is present. Besides, evidence of the consistency (soundness) of these rules is provided. A positive solution to the issue of the completeness of the formal system based on the presented rules was not found. In conclusion, the theoretical and practical importance of derivation rules for join dependencies is noted. © 2021, Allerton Press, Inc.

Cite: Zykin S.V.
Generalization of Derivation Rules for Join Dependencies in Database
Automatic Control and Computer Sciences. 2021. V.55. N7. P.731-737. DOI: 10.3103/S0146411621070191 WOS Scopus OpenAlex

Original: Зыкин С.В.
Обобщение правил вывода для зависимостей соединения в базах данных
Моделирование и анализ информационных систем. 2020. №3. С.356-365. DOI: 10.18255/1818-1015-2020-3-356-365 OpenAlex

Identifiers:

Web of science:	WOS:000749622200013
Scopus:	2-s2.0-85123927714
OpenAlex:	W4210729520

Citing:

DB	Citing
Scopus	1
OpenAlex	2
Web of science	1

Altmetrics: