FUN: An efficient algorithm for mining functional and embedded dependencies

DOI10.1007/3-540-44503-X_13MaRDI QIDQ4473271zbMATH OpenFDO

Authors Noël Novelli, Rosine Cicchetti

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1973/19730189.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Functional and embedded dependency inference: A data mining point of view
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract
• Fast algorithms of mining probability functional dependency rules in relational database
• Efficient discovery of functional dependencies with degrees of satisfaction

Cited in

(9)

• Fast algorithms of mining probability functional dependency rules in relational database
• A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
• Mining relaxed functional dependencies from data
• Functional dependencies are helpful for partial materialization of data cubes
• Efficient discovery of functional dependencies with degrees of satisfaction
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract
• Theory and Applications of Satisfiability Testing
• Functional and embedded dependency inference: A data mining point of view

Describes a project that uses

Uses Software

• TANE

This page was built for publication: FUN: An efficient algorithm for mining functional and embedded dependencies

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