A Generalization of the Inference Rules for Join Dependencies in Databases
From MaRDI portal
Publication:5060072
Recommendations
Cites work
- scientific article; zbMATH DE number 3648167 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3596227 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A Complete Axiomatization of Full Join Dependencies
- A complete axiomatization of full acyclic join dependencies
- A finite axiomatization of conditional independence and inclusion dependencies
- A formal context for acyclic join dependencies
- Appropriate inferences of data dependencies in relational databases
- Cylindric structures and dependencies in relational databases
- Formal systems for join dependencies
- Full hierarchical dependencies in fixed and undetermined universes
- Inclusion dependencies and their interaction with functional dependencies
- On the complexity of join dependencies
Cited in
(6)- scientific article; zbMATH DE number 3876647 (Why is no real title available?)
- scientific article; zbMATH DE number 2089444 (Why is no real title available?)
- Inference engine based on closure and join operators over truth table binary relations
- A formal context for acyclic join dependencies
- Some results on the deductive structure of join dependencies
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
This page was built for publication: A Generalization of the Inference Rules for Join Dependencies in Databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060072)