Decomposition of a Data Base and the Theory of Boolean Switching Functions
From MaRDI portal
Cited in
(32)- Positive Boolean dependencies
- On the normalization of relational databases
- On covering Boyce-Codd normal forms
- 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
- On the complexity of finding the set of candidate keys for a given set of functional dependencies
- 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
- Closure structures parameterized by systems of isotone Galois connections
- On sets of graded attribute implications with witnessed non-redundancy
- Monoidal functional dependencies
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
- Attribute dependencies for data with grades I,
- Optimal covers in the relational database model
- scientific article; zbMATH DE number 3907812 (Why is no real title available?)
- RECONSTRUCTABILITY ANALYSIS OF MULTI-DIMENSIONAL RELATIONS: A Theoretical Basis for Computer-Aided Determination of Acceptable Systems Models †
- A graphical interpretation of dependency structures in relational data bases
- RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography†
- Theta-join and normalization
- Structure of closures in relational schemas with join and functional dependencies
- Succinctness in dependency systems
- A subclass of Horn CNFs optimally compressible in polynomial time
- Minimal bases of temporal attribute implications
- Multivalued dependencies in fuzzy relational databases
- Disjoint essential sets of implicates of a CQ Horn function
- Some generalized type functional dependencies formalized as equality set on matrices
- Representation of functional dependencies in relational databases using linear graphs
- Abstract functional dependency structures
- Exclusive and essential sets of implicates of Boolean functions
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)