Algorithms for inferring functional dependencies from relations

From MaRDI portal
Publication:4294515

DOI10.1016/0169-023X(94)90023-XzbMath0805.68034OpenAlexW2077053297WikidataQ61450078 ScholiaQ61450078MaRDI QIDQ4294515

Heikki Mannila, Kari-Jouko Raeihae

Publication date: 15 May 1994

Published in: Data & Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-023x(94)90023-x




Related Items (22)

Improved time complexities for learning Boolean networksExtended dualization: application to maximal pattern miningMining approximate interval-based temporal dependenciesLogical Foundations of Possibilistic KeysHierarchical decompositions of implicational bases for the enumeration of meet-irreducible elementsCharacterisations of multivalued dependency implication over undetermined universesReasoning about functional and full hierarchical dependencies over partial relationsAchieving New Upper Bounds for the Hypergraph Duality Problem through LogicApproximate inference of functional dependencies from relationsComputational aspects of monotone dualization: a brief surveyClosure via functional dependence simplificationRQL: a query language for rule discovery in databasesFast algorithms for implication bases and attribute exploration using proper premisesNon-deterministic ideal operators: an adequate tool for formalization in data basesOn the complexity of inferring functional dependenciesReducing one class of machine learning algorithms to logical operations of plausible reasoningFunctional and approximate dependency mining: database and FCA points of viewFunctional and multivalued dependencies in nested databases generated by record and list constructorUsing Transversals for Discovering XML Functional DependenciesNormal forms and syntactic completeness proofs for functional independenciesPossibilistic keysOn functional dependencies in \(q\)-Horn theories




This page was built for publication: Algorithms for inferring functional dependencies from relations