FastFDs
From MaRDI portal
Cited in
(12)- TANE
- 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
- Efficient algorithms for mining inclusion dependencies
- Efficient discovery of functional dependencies with degrees of satisfaction
- Functional and approximate dependency mining: database and FCA points of view
- Improving query evaluation with approximate functional dependency based decompositions
- Using Transversals for Discovering XML Functional Dependencies
- MultiVis
- Trio
This page was built for software: FastFDs