Appropriate inferences of data dependencies in relational databases (Q429431): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The paper discusses axiomatization systems for inferring data dependencies in relational databases. These dependencies are used to constraint data stored in a relational database to fulfill certain desiderata of an application domain which could not be enforced by a relational schema per se. Specifically, the authors consider functional and full hierarchical dependencies. A functional dependency specifies that the value of a set of attributes uniquely determines the value of another set of attributes in a relation; keys are well-known examples of functional dependencies. Full hierarchical dependencies are more general than functional dependencies and allow to decompose a relation into a set of relations whose natural join gives back the original relation. The inference of data dependencies plays an important role in the implementation of database management systems, especially when views are defined over normalized schemata. Some data dependencies can be inferred from other data dependencies regardless of the underlying relational schemata. Such a dependency continues to hold if relations and attributes not involved in the dependency are modified. The axiomatization system introduced by the authors allows to imply functional and full hierarchical dependencies not depending on the underlying relational schemata by applying inference rules which only consider data dependencies. Functional and full hierarchical dependencies depending on the underlying relational schemata are instead inferred by referring to the schemata only at the last step of the inference. Correctness proofs are very technical, but the authors have included some examples in order to facilitate the understanding of the results. All in all, this is an interesting paper presenting nontrivial results on inference systems for data dependencies. It is interesting for researchers of the field, who can enjoy all technical details, but also for researchers in related fields, who instead can appreciate the main results.
Property / review text: The paper discusses axiomatization systems for inferring data dependencies in relational databases. These dependencies are used to constraint data stored in a relational database to fulfill certain desiderata of an application domain which could not be enforced by a relational schema per se. Specifically, the authors consider functional and full hierarchical dependencies. A functional dependency specifies that the value of a set of attributes uniquely determines the value of another set of attributes in a relation; keys are well-known examples of functional dependencies. Full hierarchical dependencies are more general than functional dependencies and allow to decompose a relation into a set of relations whose natural join gives back the original relation. The inference of data dependencies plays an important role in the implementation of database management systems, especially when views are defined over normalized schemata. Some data dependencies can be inferred from other data dependencies regardless of the underlying relational schemata. Such a dependency continues to hold if relations and attributes not involved in the dependency are modified. The axiomatization system introduced by the authors allows to imply functional and full hierarchical dependencies not depending on the underlying relational schemata by applying inference rules which only consider data dependencies. Functional and full hierarchical dependencies depending on the underlying relational schemata are instead inferred by referring to the schemata only at the last step of the inference. Correctness proofs are very technical, but the authors have included some examples in order to facilitate the understanding of the results. All in all, this is an interesting paper presenting nontrivial results on inference systems for data dependencies. It is interesting for researchers of the field, who can enjoy all technical details, but also for researchers in related fields, who instead can appreciate the main results. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Mario Alviano / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6048048 / rank
 
Normal rank
Property / zbMATH Keywords
 
data dependencies
Property / zbMATH Keywords: data dependencies / rank
 
Normal rank
Property / zbMATH Keywords
 
functional dependencies
Property / zbMATH Keywords: functional dependencies / rank
 
Normal rank
Property / zbMATH Keywords
 
full hierarchical dependencies
Property / zbMATH Keywords: full hierarchical dependencies / rank
 
Normal rank
Property / zbMATH Keywords
 
aximatisation systems
Property / zbMATH Keywords: aximatisation systems / rank
 
Normal rank
Property / zbMATH Keywords
 
data semantics
Property / zbMATH Keywords: data semantics / rank
 
Normal rank
Property / zbMATH Keywords
 
relational database
Property / zbMATH Keywords: relational database / rank
 
Normal rank

Revision as of 23:32, 29 June 2023

scientific article
Language Label Description Also known as
English
Appropriate inferences of data dependencies in relational databases
scientific article

    Statements

    Appropriate inferences of data dependencies in relational databases (English)
    0 references
    0 references
    0 references
    19 June 2012
    0 references
    The paper discusses axiomatization systems for inferring data dependencies in relational databases. These dependencies are used to constraint data stored in a relational database to fulfill certain desiderata of an application domain which could not be enforced by a relational schema per se. Specifically, the authors consider functional and full hierarchical dependencies. A functional dependency specifies that the value of a set of attributes uniquely determines the value of another set of attributes in a relation; keys are well-known examples of functional dependencies. Full hierarchical dependencies are more general than functional dependencies and allow to decompose a relation into a set of relations whose natural join gives back the original relation. The inference of data dependencies plays an important role in the implementation of database management systems, especially when views are defined over normalized schemata. Some data dependencies can be inferred from other data dependencies regardless of the underlying relational schemata. Such a dependency continues to hold if relations and attributes not involved in the dependency are modified. The axiomatization system introduced by the authors allows to imply functional and full hierarchical dependencies not depending on the underlying relational schemata by applying inference rules which only consider data dependencies. Functional and full hierarchical dependencies depending on the underlying relational schemata are instead inferred by referring to the schemata only at the last step of the inference. Correctness proofs are very technical, but the authors have included some examples in order to facilitate the understanding of the results. All in all, this is an interesting paper presenting nontrivial results on inference systems for data dependencies. It is interesting for researchers of the field, who can enjoy all technical details, but also for researchers in related fields, who instead can appreciate the main results.
    0 references
    0 references
    0 references
    data dependencies
    0 references
    functional dependencies
    0 references
    full hierarchical dependencies
    0 references
    aximatisation systems
    0 references
    data semantics
    0 references
    relational database
    0 references