A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules [chapter]

Raoul Medina, Lhouari Nourine
2009 Lecture Notes in Computer Science  
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 could be unified into a single
more » ... y of dependencies. Benefits of this hierarchy is that actual algorithms which discover ARs could be adapted to discover any kind of dependencies and, moreover, generate a reduced set of dependencies. We also establish the link between the problem of finding equivalent pattern tableaux of a CFD and the problem of finding keys of a relation.
doi:10.1007/978-3-642-01815-2_9 fatcat:d3k4mwjbdvh6lmpomfnzbfiktm