FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract

DOI10.1007/3-540-44801-2_11MaRDI QIDQ4535566zbMATH OpenFDO

Authors Catharine Merle Wyss, Chris Giannella, Edward L. Robertson

Publication date 16 June 2002

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/2114/21140101

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2080473
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• Functional and embedded dependency inference: A data mining point of view
• Efficient discovery of functional dependencies with degrees of satisfaction
• Fast algorithms of mining probability functional dependency rules in relational database

Cited in

(18)

• FastFDs
• Fast algorithms of mining probability functional dependency rules in relational database
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
• A note on approximation measures for multi-valued dependencies in relational databases
• Mining relaxed functional dependencies from data
• Characterizing functional dependencies in formal concept analysis with pattern structures
• Optimal covers in the relational database model
• scientific article; zbMATH DE number 2086290 (Why is no real title available?)
• Efficient discovery of functional dependencies with degrees of satisfaction
• A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• Functional and approximate dependency mining: database and FCA points of view
• scientific article; zbMATH DE number 2080473 (Why is no real title available?)
• Using Transversals for Discovering XML Functional Dependencies
• Theory and Applications of Satisfiability Testing
• Journal on Data Semantics V
• Functional and embedded dependency inference: A data mining point of view
• Non-blocking functional dependency discovery from data streams

Describes a project that uses

Uses Software

• TANE

This page was built for publication: FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract

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