Generalization of Typed Inclusion Dependencies with Null Values in Databases

— A new type of dependency in databases, which is a generalization of inclusion dependencies, is considered. Traditionally, such dependencies are used in practice to ensure referential integrity. In this case, the constraint is established only between a pair of relations, the first of which is call...

Full description

Saved in:
Bibliographic Details
Published in:Automatic control and computer sciences Vol. 58; no. 7; pp. 861 - 868
Main Author: Zykin, S. V.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.12.2024
Springer Nature B.V
Subjects:
Algorithms
Axioms
Computer Science
Constraints
Control Structures and Microprogramming
Database design
Integrity
database
axiomatics
null values
inclusion dependencies
ISSN:0146-4116, 1558-108X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:— A new type of dependency in databases, which is a generalization of inclusion dependencies, is considered. Traditionally, such dependencies are used in practice to ensure referential integrity. In this case, the constraint is established only between a pair of relations, the first of which is called the main relation, and the second one is the external relation. In practice, referential integrity often needs to be established for a larger number of relations, where several main relations and several external relations participate in the same constraint. This structure corresponds to an ultragraph. Generalized inclusion dependencies that take into account the presence of null values in external relations are justified. The system of axioms is obtained based on a study of the properties of typed dependencies. The consistency (soundness) and completeness of the system are proved.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0146-4116
1558-108X
DOI:10.3103/S0146411624700317