Decomposition of a Data Base and the Theory of Boolean Switching Functions

DOI10.1147/rd.175.0374zbMath0259.68016OpenAlexW2074023317MaRDI QIDQ5674969

Richard G. Casey, Claude Delobel

Publication date: 1973

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7292fbb049589d9a7964cfd6d55149f181e45893

Mathematics Subject Classification ID

Related Items (32)

Optimal covers in the relational database model ⋮ Positive Boolean dependencies ⋮ Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing ⋮ Succinctness in dependency systems ⋮ Structure of closures in relational schemas with join and functional dependencies ⋮ Closure structures parameterized by systems of isotone Galois connections ⋮ On the normalization of relational databases ⋮ Attribute dependencies for data with grades I^, ⋮ On covering Boyce-Codd normal forms ⋮ On the formal properties of transitive inheritance in databases ⋮ On sets of graded attribute implications with witnessed non-redundancy ⋮ Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time ⋮ Unnamed Item ⋮ Selective inheritance of attribute values in relational databases ⋮ A subclass of Horn CNFs optimally compressible in polynomial time ⋮ Exclusive and essential sets of implicates of Boolean functions ⋮ On the complexity of finding the set of candidate keys for a given set of functional dependencies ⋮ Minimal bases of temporal attribute implications ⋮ On the number of candidate keys ⋮ Candidate keys for relations ⋮ Contribution to the theory of data base relations ⋮ Testing for existence of a covering Boyce-Codd normal form ⋮ Multivalued dependencies in fuzzy relational databases ⋮ RECONSTRUCTABILITY ANALYSIS OF MULTI-DIMENSIONAL RELATIONS: A Theoretical Basis for Computer-Aided Determination of Acceptable Systems Models † ⋮ Disjoint essential sets of implicates of a CQ Horn function ⋮ A graphical interpretation of dependency structures in relational data bases ⋮ RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography† ⋮ Some generalized type functional dependencies formalized as equality set on matrices ⋮ Representation of functional dependencies in relational databases using linear graphs ⋮ Theta-join and normalization ⋮ Abstract functional dependency structures ⋮ Monoidal functional dependencies

This page was built for publication: Decomposition of a Data Base and the Theory of Boolean Switching Functions