A Generalization of the Inference Rules for Join Dependencies in Databases
In this paper a generalisation of the inference rules of the join dependencies that are used in the design of database schemas that meets the requirements of the fifth normal form is considered. In the previous works devoted to this problem, attempts to construct systems of the axioms of such depend...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2020-09-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1354 |
| _version_ | 1797877855058657280 |
|---|---|
| author | Sergey V. Zykin |
| author_facet | Sergey V. Zykin |
| author_sort | Sergey V. Zykin |
| collection | DOAJ |
| description | In this paper a generalisation of the inference rules of the join dependencies that are used in the design of database schemas that meets the requirements of the fifth normal form is considered. In the previous works devoted to this problem, attempts to construct systems of the axioms of such dependencies based on inference rules are made. However, while the justification for the consistency (soundness) of the obtained axioms does not cause difficulties, the proof of completeness in general has not been satisfactorily resolved. First of all, this is due to the limitations of the inference rules themselves. This work focuses on two original axiom systems presented in the works of Sciore and Malvestuto. For the inclusion dependencies a system of rules that generalises existing systems and has fewer restrictions has been obtained. The paper presents a proof of the derivability of known systems of axioms from the presented inference rules. In addition, evidence of the consistency (soundness) of these rules is provided. The question of the completeness of the formal system based on the presented rules did not find a positive solution. In conclusion, the theoretical and practical significance of the inference rules for the join dependencies is noted. |
| first_indexed | 2024-04-10T02:23:47Z |
| format | Article |
| id | doaj.art-1b04107f3cb249d7a12e254b8141916a |
| institution | Directory Open Access Journal |
| issn | 1818-1015 2313-5417 |
| language | English |
| last_indexed | 2024-04-10T02:23:47Z |
| publishDate | 2020-09-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj.art-1b04107f3cb249d7a12e254b8141916a2023-03-13T08:07:35ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172020-09-0127335636510.18255/1818-1015-2020-3-356-3651013A Generalization of the Inference Rules for Join Dependencies in DatabasesSergey V. Zykin0Институт математики им. С.Л. Соболева, СО РАНIn this paper a generalisation of the inference rules of the join dependencies that are used in the design of database schemas that meets the requirements of the fifth normal form is considered. In the previous works devoted to this problem, attempts to construct systems of the axioms of such dependencies based on inference rules are made. However, while the justification for the consistency (soundness) of the obtained axioms does not cause difficulties, the proof of completeness in general has not been satisfactorily resolved. First of all, this is due to the limitations of the inference rules themselves. This work focuses on two original axiom systems presented in the works of Sciore and Malvestuto. For the inclusion dependencies a system of rules that generalises existing systems and has fewer restrictions has been obtained. The paper presents a proof of the derivability of known systems of axioms from the presented inference rules. In addition, evidence of the consistency (soundness) of these rules is provided. The question of the completeness of the formal system based on the presented rules did not find a positive solution. In conclusion, the theoretical and practical significance of the inference rules for the join dependencies is noted.https://www.mais-journal.ru/jour/article/view/1354реляционные базы данныхзависимости соединенияправила вывода |
| spellingShingle | Sergey V. Zykin A Generalization of the Inference Rules for Join Dependencies in Databases Моделирование и анализ информационных систем реляционные базы данных зависимости соединения правила вывода |
| title | A Generalization of the Inference Rules for Join Dependencies in Databases |
| title_full | A Generalization of the Inference Rules for Join Dependencies in Databases |
| title_fullStr | A Generalization of the Inference Rules for Join Dependencies in Databases |
| title_full_unstemmed | A Generalization of the Inference Rules for Join Dependencies in Databases |
| title_short | A Generalization of the Inference Rules for Join Dependencies in Databases |
| title_sort | generalization of the inference rules for join dependencies in databases |
| topic | реляционные базы данных зависимости соединения правила вывода |
| url | https://www.mais-journal.ru/jour/article/view/1354 |
| work_keys_str_mv | AT sergeyvzykin ageneralizationoftheinferencerulesforjoindependenciesindatabases AT sergeyvzykin generalizationoftheinferencerulesforjoindependenciesindatabases |