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

Cited in

(32)

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

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

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