Graph Algorithms for Functional Dependency Manipulation
From MaRDI portal
Publication:3026384
DOI10.1145/2157.322404zbMath0624.68089OpenAlexW2064529725MaRDI QIDQ3026384
Domenico Saccà, Alessandro D'Atri, 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
relational databasesfunctional dependenciesminimal coveringsalgorithms for manipulating dependencies
Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)
Related Items
Computing unique canonical covers for simple FDs via transitive reduction, Optimal covers in the relational database model, Directed Moore hypergraphs, On the size of nonredundant FD-covers, Flows on hypergraphs, A Port Graph Rewriting Approach to Relational Database Modelling, Linear time analysis of properties of conflict-free and general Petri nets, Non-oblivious local search for graph and hypergraph coloring problems, Dynamic maintenance of directed hypergraphs, Unnamed Item, Directed hypergraphs: introduction and fundamental algorithms -- a survey, On the complexity of strongly connected components in directed hypergraphs, 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, Minimal functional routes in directed graphs with dependent edges, Primitive tensors and directed hypergraphs, An efficient algorithm for 3NF determination, Partially dynamic maintenance of minimum weight hyperpaths, Derivation digraphs for dependencies in ordinal and similarity-based data, Directed hypergraphs and applications, Linear connectivity problems in directed hypergraphs
