Minimum Covers in Relational Database Model
From MaRDI portal
Publication:3919121
DOI10.1145/322217.322223zbMath0466.68085WikidataQ63252928 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
68Q25: Analysis of algorithms and problem complexity
68P05: Data structures
68P20: Information storage and retrieval of data
68N25: Theory of operating systems
Related Items
Functional and approximate dependency mining: database and FCA points of view, Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory, 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, Succinctness in dependency systems, Disjoint essential sets of implicates of a CQ Horn function, Deciding implication for functional dependencies in complex-value databases, Propagating XML constraints to relations, The synthesis approach for relational database design: An expanded perspective, Exclusive and essential sets of implicates of Boolean functions, Synthesis of unnormalized relations incorporating more meaning, Computing the minimum cover of functional dependencies, On the size of nonredundant FD-covers, A note on relation schemes which are in 3NF but not in BCNF, Generating a condensed representation for association rules, Directed hypergraphs and applications, On the relationship of minimum and optimum covers for a set of functional dependencies, Fuzzy functional dependencies and independencies in extended fuzzy relational database models, Some results about normal forms for functional dependency in the relational datamodel, Bidual Horn functions and extensions, Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets, 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, Redundancy in logic. I: CNF propositional formulae, Functional and multivalued dependencies in nested databases generated by record and list constructor, Structure of closures in relational schemas with join and functional dependencies
