Appropriate inferences of data dependencies in relational databases (Q429431): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10472-012-9275-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2010405333 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4864249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4050122 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the menbership problem for functional and multivalued dependencies in relational databases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formal systems for join dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inferences of multivalued dependencies in fixed and undetermined universes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Design of relational database schemes by deleting attributes in the canonical decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5714254 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Implication Problem for Functional and Inclusion Dependencies is Undecidable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A relational model of data for large shared data banks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a problem of Fagin concerning multivalued dependencies in relational databases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterising nested database dependencies by fragments of propositional logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Inferences ofWeak Multivalued Dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical constraints on XML data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full hierarchical dependencies in fixed and undetermined universes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Functional and multivalued dependencies in nested databases generated by record and list constructor / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving the Implication Problem for XML Functional Dependencies with Properties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the undecidability of implications between embedded multivalued database dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies'' / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Determining View dependencies using tableaux / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiomatisation of functional dependencies in incomplete relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Equivalence of Database Models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Foundations of Information and Knowledge Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Charting the completeness frontier of inference systems for multivalued dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Testing Implications of Functional and Join Dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Axiomatizing Multivalued Dependencies in Relational Databases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Logical and algorithmic properties of stable conditional independence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997653 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite approximatization of languages for representation of system properties: Axiomatization of dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4486417 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using Transversals for Discovering XML Functional Dependencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4444370 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the design of relational database schemata / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:32, 5 July 2024
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
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
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references