Graphical axiomatization of sets of functional dependencies in relational databases
From MaRDI portal
Recommendations
- Graphs representing sets of functional dependencies
- Graph Algorithms for Functional Dependency Manipulation
- Reasoning methods for designing and surveying relationships described by sets of functional constraints
- scientific article; zbMATH DE number 4009860
- Representation of functional dependencies in relational databases using linear graphs
Cited in
(8)- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Implication and axiomatization of functional and constant constraints
- Graph Algorithms for Functional Dependency Manipulation
- Reasoning methods for designing and surveying relationships described by sets of functional constraints
- Graphs representing sets of functional dependencies
- Finding the transitive closure of functional dependencies using strategic port graph rewriting
- A port graph rewriting approach to relational database modelling
- Representation of functional dependencies in relational databases using linear graphs
This page was built for publication: Graphical axiomatization of sets of functional dependencies in relational databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499372)