A Complete Axiomatization of Full Join Dependencies
From MaRDI portal
Cited in
(19)- Formal systems for join dependencies
- The implication and finite implication problems for typed template dependencies
- Completeness issues for join dependencies derived from the universal relation join dependency
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
- Relational decomposition and structural analysis of systems
- Adequacy of decompositions of relational databases
- Inferring multivalued dependencies from functional and join dependencies
- Algebraic dependencies
- A universal formalism to express decompositions, functional dependencies and other constraints in a relational database
- Generating hinges from arbitrary subhypergraphs
- Inferring null join dependencies in relational databases
- A complete axiomatization of full acyclic join dependencies
- Another view of functional and multivalued dependencies in the relational database model
- Characterization of optimal complements of database views defined by projection
- Structure of closures in relational schemas with join and functional dependencies
- Characterisations of multivalued dependency implication over undetermined universes
- A Generalization of the Inference Rules for Join Dependencies in Databases
- Some results on the deductive structure of join dependencies
- Testing arbitrary subhypergraphs for the lossless join property
This page was built for publication: A Complete Axiomatization of Full Join Dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945627)
