Graph Algorithms for Functional Dependency Manipulation

DOI10.1145/2157.322404MaRDI QIDQ3026384zbMATH OpenOpenAlexFDO

Authors Alessandro D'Atri, Domenico Saccà, Giorgio Ausiello

Publication date 1983

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2157.322404

zbMATH Keywords

algorithms for manipulating dependenciesfunctional dependenciesminimal coveringsrelational databases

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Representation of functional dependencies in relational databases using linear graphs
• Functional dependencies in relational databases: A lattice point of view
• Graphical axiomatization of sets of functional dependencies in relational databases
• scientific article; zbMATH DE number 3911762
• Algorithms for inferring functional dependencies from relations

Cited in

(30)

• Linear connectivity problems in directed hypergraphs
• On the size of nonredundant FD-covers
• Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in O(N^ 2) time
• The effect of unary inclusion dependencies on relational database design
• Flows on hypergraphs
• Partially dynamic maintenance of minimum weight hyperpaths
• Directed hypergraphs and applications
• Directed Moore hypergraphs
• Primitive tensors and directed hypergraphs
• Optimal covers in the relational database model
• Graphical axiomatization of sets of functional dependencies in relational databases
• Graphs representing sets of functional dependencies
• scientific article; zbMATH DE number 1305093 (Why is no real title available?)
• Minimal functional routes in directed graphs with dependent edges
• Dependencies for Graphs
• Finding the transitive closure of functional dependencies using strategic port graph rewriting
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• A port graph rewriting approach to relational database modelling
• On the complexity of strongly connected components in directed hypergraphs
• An efficient algorithm for 3NF determination
• Non-oblivious local search for graph and hypergraph coloring problems
• Linear time analysis of properties of conflict-free and general Petri nets
• Chemically inspired Erdős-Rényi hypergraphs
• An assessment of assignment schemes for dependency graphs
• A characterization of irreducible tensors by using the connectedness of the associated directed hypergraphs
• Derivation digraphs for dependencies in ordinal and similarity-based data
• Targeted least cardinality candidate key for relational databases
• Transitivity preserving projection in directed hypergraphs
• Computing unique canonical covers for simple FDs via transitive reduction
• Dynamic maintenance of directed hypergraphs

This page was built for publication: Graph Algorithms for Functional Dependency Manipulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026384)