Minimum Covers in Relational Database Model
From MaRDI portal
Publication:3919121
DOI10.1145/322217.322223zbMath0466.68085OpenAlexW2012644520WikidataQ63252928 ScholiaQ63252928MaRDI QIDQ3919121
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322217.322223
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)
Related Items (50)
A note on relation schemes which are in 3NF but not in BCNF ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Optimal covers in the relational database model ⋮ Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing ⋮ Redundancy in logic. II: 2CNF and Horn propositional formulae ⋮ Redundancy in logic. III: Non-monotonic reasoning ⋮ On the size of nonredundant FD-covers ⋮ Deciding implication for functional dependencies in complex-value databases ⋮ Optimum basis of finite convex geometry ⋮ Succinctness in dependency systems ⋮ Fuzzy functional dependencies and independencies in extended fuzzy relational database models ⋮ Structure of closures in relational schemas with join and functional dependencies ⋮ Learning a propagation complete formula ⋮ Directed hypergraphs and Horn minimization ⋮ Propagating XML constraints to relations ⋮ Some results about normal forms for functional dependency in the relational datamodel ⋮ A decomposition method for CNF minimality proofs ⋮ A Port Graph Rewriting Approach to Relational Database Modelling ⋮ On vertex independence number of uniform hypergraphs ⋮ Boolean functions with a simple certificate for CNF complexity ⋮ Construction and learnability of canonical Horn formulas ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ Unnamed Item ⋮ The synthesis approach for relational database design: An expanded perspective ⋮ Bidual Horn functions and extensions ⋮ Boolean functions with long prime implicants ⋮ Counting subset repairs with functional dependencies ⋮ Redundancy in logic. I: CNF propositional formulae ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Succinctness and tractability of closure operator representations ⋮ Learning definite Horn formulas from closure queries ⋮ Hardness results for approximate pure Horn CNF formulae minimization ⋮ A subclass of Horn CNFs optimally compressible in polynomial time ⋮ Exclusive and essential sets of implicates of Boolean functions ⋮ A compact representation for modular semilattices and its applications ⋮ Generating a condensed representation for association rules ⋮ Functional and approximate dependency mining: database and FCA points of view ⋮ Functional and multivalued dependencies in nested databases generated by record and list constructor ⋮ Minimal bases of temporal attribute implications ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ Derivation digraphs for dependencies in ordinal and similarity-based data ⋮ Directed hypergraphs and applications ⋮ On implicational bases of closure systems with unique critical sets. ⋮ Quasi-closed elements in fuzzy posets ⋮ Disjoint essential sets of implicates of a CQ Horn function ⋮ On the relationship of minimum and optimum covers for a set of functional dependencies ⋮ Approximating Minimum Representations of Key Horn Functions ⋮ Synthesis of unnormalized relations incorporating more meaning ⋮ Monoidal functional dependencies ⋮ Computing the minimum cover of functional dependencies
This page was built for publication: Minimum Covers in Relational Database Model
