Appropriate inferences of data dependencies in relational databases
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.
- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes
- Reasoning about functional and full hierarchical dependencies over partial relations
- scientific article; zbMATH DE number 4009860
- scientific article; zbMATH DE number 2038176
- Charting the completeness frontier of inference systems for multivalued dependencies
- A relational model of data for large shared data banks
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
- Axiomatisation of functional dependencies in incomplete relations
- Characterising nested database dependencies by fragments of propositional logic
- Charting the completeness frontier of inference systems for multivalued dependencies
- Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
- Design of relational database schemes by deleting attributes in the canonical decomposition
- Determining View dependencies using tableaux
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
- Formal systems for join dependencies
- Foundations of Information and Knowledge Systems
- Full hierarchical dependencies in fixed and undetermined universes
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- scientific article; zbMATH DE number 41085 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 2033268 (Why is no real title available?)
- scientific article; zbMATH DE number 1466150 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 2241913 (Why is no real title available?)
- Inferences of multivalued dependencies in fixed and undetermined universes
- Logical and algorithmic properties of stable conditional independence
- Numerical constraints on XML data
- On a problem of Fagin concerning multivalued dependencies in relational databases
- On Axiomatizing Multivalued Dependencies in Relational Databases
- On Inferences ofWeak Multivalued Dependencies
- On the Complexity of Testing Implications of Functional and Join Dependencies
- On the design of relational database schemata
- On the Equivalence of Database Models
- ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS
- On the menbership problem for functional and multivalued dependencies in relational databases
- On the role of the complementation rule for data dependencies over incomplete relations
- On the undecidability of implications between embedded multivalued database dependencies
- Solving the implication problem for XML functional dependencies with properties
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Using Transversals for Discovering XML Functional Dependencies
- Inferences for numerical dependencies
- Selective inheritance of attribute values in relational databases
- Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations
- Full hierarchical dependencies in fixed and undetermined universes
- Reasoning about functional and full hierarchical dependencies over partial relations
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- On inferences of full first-order hierarchical decompositions
- Analyzing FD inference in relational databases
- scientific article; zbMATH DE number 5666450 (Why is no real title available?)
- Weak functional dependencies: full propositional expressiveness for the database practitioner
- scientific article; zbMATH DE number 4057062 (Why is no real title available?)
- scientific article; zbMATH DE number 4087082 (Why is no real title available?)
- scientific article; zbMATH DE number 4116031 (Why is no real title available?)
- A Generalization of the Inference Rules for Join Dependencies in Databases
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes
- Relational schemas with multiplicity bounds, diversity bounds and functional dependencies
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
This page was built for publication: Appropriate inferences of data dependencies in relational databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429431)
