Abstract: The theory and algorithms required to construct the minimal covering of generalized typed inclusion dependencies are discussed. Traditionally, the construction of the minimal covering is used for all types of dependencies in order to obtain a nonredundant and consistent database design. Generalized inclusion dependencies correspond to referential integrity constraints, when several main relations and several external relations are involved in one constraint, which corresponds to an ultragraph edge. A system of axioms with proof of consistency and completeness based on the study of dependency properties is presented in the previous study. In this study, closures for generalized typed inclusion dependencies are studied. An algorithm for constructing closures is developed. The correctness of the algorithm is proved. The results are further used to develop an algorithm for constructing the minimum covering. Examples that demonstrate the operation of the algorithms are presented at the end of the article.

Cite: Zykin S.V.
Minimal Covering of Generalized Typed Inclusion Dependencies in Databases
Automatic Control and Computer Sciences. 2024. V.58. N7. P.319-328. DOI: 10.3103/S0146411624700457 WOS Scopus РИНЦ OpenAlex

Original: Зыкин С.В.
Минимальное покрытие обобщенных типизированных зависимостей включения в базах данных
Моделирование и анализ информационных систем. 2024. Т.31. №1. С.78-89. DOI: 10.18255/1818-1015-2024-1-78-89 РИНЦ OpenAlex

Dates:

Submitted:	Feb 12, 2024
Accepted:	Feb 28, 2024
Published print:	Feb 12, 2025
Published online:	Feb 12, 2025

Identifiers:

Web of science:	WOS:001421219900008
Scopus:	2-s2.0-85218335901
Elibrary:	80321028
OpenAlex:	W4407402227

Citing: Пока нет цитирований

Altmetrics: