Analysis of Typed Inclusion Dependencies with Null Values
Null values have become an urgent problem since the creation of the relational data model. The impact of the uncertainty affects all types of dependencies used in the design and operation of the database. This fully applies to the inclusion dependencies, which are the theoretical basis for referentia...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2017-04-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/506 |
| _version_ | 1797878016791019520 |
|---|---|
| author | Vladimir S. Zykin Sergey V. Zykin |
| author_facet | Vladimir S. Zykin Sergey V. Zykin |
| author_sort | Vladimir S. Zykin |
| collection | DOAJ |
| description | Null values have become an urgent problem since the creation of the relational data model. The impact of the uncertainty affects all types of dependencies used in the design and operation of the database. This fully applies to the inclusion dependencies, which are the theoretical basis for referential integrity on the data. Attempts to solve this problem contain inaccuracy in the statement of the problem and its solution. The errors in formulation of the problem can be associated with the use in the definition of untyped inclusion dependencies, which leads to permutations of the attributes, although, the attributes in database technology are identified by name and not by their place. In addition, linking with the use of the inclusion dependencies of heterogeneous attributes, even of the same type, is a sign of lost functional dependencies and leads to interaction of inclusion dependencies and non-trivial functional dependencies. Inaccuracies in the solution of the problem are contained in the statements of axioms and the proof of their properties, including completeness. In this paper we propose an original solution of this problem only for typed inclusion dependencies in the presence of Null values: a new axiom system is proposed, its completeness and soundness are proved. On the basis of inference rules we developed an algorithm for the construction of a not surplus set of typed inclusion dependencies. The correctness of the algorithm is proved. |
| first_indexed | 2024-04-10T02:26:04Z |
| format | Article |
| id | doaj.art-6bcf5cf1e6f84d46924b071e02520e7b |
| institution | Directory Open Access Journal |
| issn | 1818-1015 2313-5417 |
| language | English |
| last_indexed | 2024-04-10T02:26:04Z |
| publishDate | 2017-04-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj.art-6bcf5cf1e6f84d46924b071e02520e7b2023-03-13T08:07:29ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172017-04-0124215516710.18255/1818-1015-2017-2-155-167359Analysis of Typed Inclusion Dependencies with Null ValuesVladimir S. Zykin0Sergey V. Zykin1Омский государственный технический университетИнститут математики им. С.Л. Соболева СО РАНNull values have become an urgent problem since the creation of the relational data model. The impact of the uncertainty affects all types of dependencies used in the design and operation of the database. This fully applies to the inclusion dependencies, which are the theoretical basis for referential integrity on the data. Attempts to solve this problem contain inaccuracy in the statement of the problem and its solution. The errors in formulation of the problem can be associated with the use in the definition of untyped inclusion dependencies, which leads to permutations of the attributes, although, the attributes in database technology are identified by name and not by their place. In addition, linking with the use of the inclusion dependencies of heterogeneous attributes, even of the same type, is a sign of lost functional dependencies and leads to interaction of inclusion dependencies and non-trivial functional dependencies. Inaccuracies in the solution of the problem are contained in the statements of axioms and the proof of their properties, including completeness. In this paper we propose an original solution of this problem only for typed inclusion dependencies in the presence of Null values: a new axiom system is proposed, its completeness and soundness are proved. On the basis of inference rules we developed an algorithm for the construction of a not surplus set of typed inclusion dependencies. The correctness of the algorithm is proved.https://www.mais-journal.ru/jour/article/view/506база данныхзависимости включенияаксиоматиканеопределенные значения |
| spellingShingle | Vladimir S. Zykin Sergey V. Zykin Analysis of Typed Inclusion Dependencies with Null Values Моделирование и анализ информационных систем база данных зависимости включения аксиоматика неопределенные значения |
| title | Analysis of Typed Inclusion Dependencies with Null Values |
| title_full | Analysis of Typed Inclusion Dependencies with Null Values |
| title_fullStr | Analysis of Typed Inclusion Dependencies with Null Values |
| title_full_unstemmed | Analysis of Typed Inclusion Dependencies with Null Values |
| title_short | Analysis of Typed Inclusion Dependencies with Null Values |
| title_sort | analysis of typed inclusion dependencies with null values |
| topic | база данных зависимости включения аксиоматика неопределенные значения |
| url | https://www.mais-journal.ru/jour/article/view/506 |
| work_keys_str_mv | AT vladimirszykin analysisoftypedinclusiondependencieswithnullvalues AT sergeyvzykin analysisoftypedinclusiondependencieswithnullvalues |