Algorithms for inferring functional dependencies from relations
From MaRDI portal
Recommendations
Cited in
(34)- On the complexity of inferring functional dependencies
- On functional dependencies in q-Horn theories
- Inferring minimal functional dependencies in Horn and q-Horn theories
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
- Reducing one class of machine learning algorithms to logical operations of plausible reasoning
- Fast algorithms for implication bases and attribute exploration using proper premises
- Algebraization of inferring functional dependences in relational databases
- Possibilistic keys
- Reasoning about functional and full hierarchical dependencies over partial relations
- Non-deterministic ideal operators: an adequate tool for formalization in data bases
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- Extended dualization: application to maximal pattern mining
- Improved time complexities for learning Boolean networks
- Logical foundations of possibilistic keys
- Graph Algorithms for Functional Dependency Manipulation
- AN ALGORITHM FOR FINDING ALL FUNCTIONS EMBEDDED IN A RELATION
- Mining approximate interval-based temporal dependencies
- scientific article; zbMATH DE number 3980485 (Why is no real title available?)
- Discovering functional and inclusion dependencies in relational databases
- Characterisations of multivalued dependency implication over undetermined universes
- Functional and approximate dependency mining: database and FCA points of view
- Relational decomposition through partial functional dependencies
- Achieving new upper bounds for the hypergraph duality problem through logic
- scientific article; zbMATH DE number 846961 (Why is no real title available?)
- Closure via functional dependence simplification
- Technical Correspondence
- RQL: a query language for rule discovery in databases
- Using Transversals for Discovering XML Functional Dependencies
- Theory and Applications of Satisfiability Testing
- Normal forms and syntactic completeness proofs for functional independencies
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
- Approximate inference of functional dependencies from relations
- Computational aspects of monotone dualization: a brief survey
This page was built for publication: Algorithms for inferring functional dependencies from relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294515)