Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
Constraint-generating dependencies
Journal of Computer and System Sciences
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Towards the Reverse Engineering of Denormalized Relational Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A Logical Generalization of Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Generalized Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Many-Valued Context Analysis Using Descriptions
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Conditional functional dependencies for capturing data inconsistencies
ACM Transactions on Database Systems (TODS)
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Generating positive and negative exact rules using formal concept analysis: problems and solutions
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
The agree concept lattice for multidimensional database analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
| Hi-index | 0.00 |
Conditional Functional Dependencies (CFDs) are Functional Dependencies (FDs) that hold on a fragment relation of the original relation. In [17], the hierarchy between CFDs, association rules and some other dependencies have been shown. This paper exhibits the relation between CFDs and FCA. Given a many-valued relation we define a labeled lattice which gives a synthetic representation of the hierarchy of dependencies. Moreover, a formal concept in the nominal scaling of the relation is an instance of a closed set in the labeled lattice. Pure CFDs correspond to edges in this labeled lattice. We exhibit a monotone function on CFDs allowing search and pruning strategies. We also show that transitive edges induce redundant CFDs.