RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2017, Volume 24, Number 2, Pages 155–167 (Mi mais555)  

Analysis of typed inclusion dependencies with null values

V. S. Zykina, S. V. Zykinb

a Omsk State Technical University, 11 Mira av., Omsk 644050, Russia
b Sobolev Institute of Mathematics SB RAS, 13 Pevtsova str., Omsk 644043, Russia

Abstract: 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.

Keywords: database, inclusion dependences, axiomatic, NULL values.

DOI: https://doi.org/10.18255/1818-1015-2017-2-155-167

Full text: PDF file (527 kB)
References: PDF file   HTML file

UDC: 004.652.4
Received: 24.08.2016

Citation: V. S. Zykin, S. V. Zykin, “Analysis of typed inclusion dependencies with null values”, Model. Anal. Inform. Sist., 24:2 (2017), 155–167

Citation in format AMSBIB
\Bibitem{ZykZyk17}
\by V.~S.~Zykin, S.~V.~Zykin
\paper Analysis of typed inclusion dependencies with null values
\jour Model. Anal. Inform. Sist.
\yr 2017
\vol 24
\issue 2
\pages 155--167
\mathnet{http://mi.mathnet.ru/mais555}
\crossref{https://doi.org/10.18255/1818-1015-2017-2-155-167}
\elib{http://elibrary.ru/item.asp?id=29063999}


Linking options:
  • http://mi.mathnet.ru/eng/mais555
  • http://mi.mathnet.ru/eng/mais/v24/i2/p155

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Моделирование и анализ информационных систем
    Number of views:
    This page:103
    Full text:38
    References:11

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020