A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules

  title={A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules},
  author={Raoul Medina and Lhouari Nourine},
Conditional Functional Dependencies (CFDs) are Functional Dependencies (FDs) that hold on a fragment relation of the original relation. In this paper, we show the hierarchy between FDs, CFDs and Association Rules (ARs): FDs are the union of CFDs while CFDs are the union of ARs. We also show the link between Approximate Functional Dependencies (AFDs) and approximate ARs. In this paper, we show that all those dependencies are indeed structurally the same and can be unified into a single hierarchy… 

Conditional Functional Dependencies: An FCA Point of View

A monotone function on CFDs allowing search and pruning strategies is exhibited and it is shown that transitive edges induce redundant CFDs.

Discovering (frequent) constant conditional functional dependencies

This paper introduces the first results on constant CFD inference and focuses on two types of techniques inherited from FD inference: the first one extends the notion of agree sets and the second one extendsThe notion of non-redundant sets, closure and quasi-closure.

Characterizing functional dependencies in formal concept analysis with pattern structures

This work shows how to characterize functional dependencies using the formalism of pattern structures, an extension of classical FCA to handle complex data, and shows how another class of dependencies can be characterized with that framework, namely, degenerated multivalued dependencies.

Discovering Conditional Functional Dependencies

This paper develops techniques for discovering CFDs from sample relations that can be multiple orders of magnitude faster than CTANE and FastCFD for constant CFD discovery, and leverages closed-itemset mining to reduce search space.

Explorer Discovering Conditional Functional Dependencies

This paper provides three methods for CFD discovery, based on techniques for mining closed item sets, and is used to discover constant CFDs, namely, CFDs with constant patterns only.

Discovering Functional Dependencies and Association Rules by Navigating in a Lattice of OLAP Views

This work proposes a new way to display and navigate through Functional Dependencies rules, based on On-Line Analytical Processing (OLAP), presenting a set of rules as a cube, where dimensions correspond to the premises of rules.

Revisiting Conditional Functional Dependency Discovery: Splitting the "C" from the "FD"

This paper regards CFDs as an extension of association rules, and presents three general methodologies for (approximate) CFD discovery, each using a different way of combining pattern mining for discovering the conditions (the “C” in CFD) with FD discovery.

Performance of Data Cleaning Techniques

To effectively identify data cleaning rules, 4 techniques for cleaning the data from sample relations are taken and found out time and space complexity of each algorithm to know which technique will be helpful in which case and display the results in the form of line and bar charts.

Mining Constant Conditional Functional Dependencies for Improving Data Quality

Experimental results on two real-world data sets show that the data mining techniques in the area of data cleaning as effective in discovering Constant Conditional Functional Dependencies from relational databases.



Conditional Functional Dependencies for Data Cleaning

This work develops techniques for detecting CFD violations in SQL as well as novel techniques for checking multiple constraints in a single query, and experimentally evaluates the performance of the CFD-based methods for inconsistency detection.

Conditional functional dependencies for capturing data inconsistencies

This work proposes a class of integrity constraints for relational databases, referred to as conditional functional dependencies (CFDs), and provides an inference system analogous to Armstrong's axioms for FDs, and shows that the implication problem is coNP-complete for CFDs in contrast to the linear-time complexity for their traditional counterpart.

Reasoning about functional dependencies generalized for semantic data models

The richer expressiveness of this more general functional dependency for semantic data models that derives from their common feature in which the separate notions of domain and relation in the relational model are combined into a single notion of class is proved.

On generating near-optimal tableaux for conditional functional dependencies

This paper is the first to formally characterize a "good" pattern tableau, based on naturally desirable properties of support, confidence and parsimony, and shows that the problem of generating an optimal tableau for a given FD is NP-complete but can be approximated in polynomial time via a greedy algorithm.

On the Structure of Armstrong Relations for Functional Dependencies

It is shown that the time complexity of finding an Armstrong relation, a relation that satisfies each FD implied by the set but no FD that is not implied by it, is precisely exponential in the number of attributes.

Discovering Agree Sets for Database Relation Analysis

A framework is defined in order to deal with a broad class of data mining algorithms for database relation analysis: Functional dependency inference, minimal key inference, sampling database relations and testing normal forms and a new characterization of left-hand sides of minimal functional dependencies is given.

Constraint-Generating Dependencies

The main technical results in the paper are a general decision procedure for the implication and consistency problems for constraint-generating dependencies, and complexity results for specific classes of such dependencies over given domains.

An Algorithm for Horizontal Decompositions

Discovering data quality rules

This work proposes a new data-driven tool that can be used within an organization's data quality management process to suggest possible rules, and to identify conformant and non-conformant records.

Formal Systems for Tuple and Equality Generating Dependencies

This work develops several formal systems for tuple and equality generating dependencies and shows that finding a formal system for embedded multivalued dependencies is equivalent to solving the implication problem for that class.