A Generalization of the Inference Rules for Join Dependencies in Databases
From MaRDI portal
Publication:5060072
DOI10.18255/1818-1015-2020-3-356-365OpenAlexW3088671735WikidataQ114048755 ScholiaQ114048755MaRDI QIDQ5060072FDOQ5060072
Authors: S. V. Zykin 
Publication date: 17 January 2023
Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mais721
Recommendations
Cites Work
- A finite axiomatization of conditional independence and inclusion dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inclusion dependencies and their interaction with functional dependencies
- Formal systems for join dependencies
- A complete axiomatization of full acyclic join dependencies
- A Complete Axiomatization of Full Join Dependencies
- Cylindric structures and dependencies in relational databases
- Full hierarchical dependencies in fixed and undetermined universes
- Appropriate inferences of data dependencies in relational databases
- Title not available (Why is that?)
- On the complexity of join dependencies
- A formal context for acyclic join dependencies
Cited In (6)
- Inference engine based on closure and join operators over truth table binary relations
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
- Title not available (Why is that?)
- A formal context for acyclic join dependencies
- Title not available (Why is that?)
- Some results on the deductive structure of join 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)
