Characterizing Covers of Functional Dependencies using FCA

Abstract : Functional dependencies (FDs) can be used for various important operations on data, for instance, checking the consistency and the quality of a database (including databases that contain complex data). Consequently, a generic framework that allows mining a sound, complete, non-redundant and yet compact set of FDs is an important tool for many different applications. There are different definitions of such sets of FDs (usually called cover). In this paper, we present the characterization of two different kinds of covers for FDs in terms of pattern structures. The convenience of such a characterization is that it allows an easy implementation of efficient mining algorithms which can later be easily adapted to other kinds of similar dependencies. Finally, we present empirical evidence that the proposed approach can perform better than state-of-the-art FD miner algorithms in large databases.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01856516
Contributor : Mehdi Kaytoue <>
Submitted on : Sunday, August 12, 2018 - 7:52:45 AM
Last modification on : Tuesday, December 18, 2018 - 4:38:02 PM
Long-term archiving on : Tuesday, November 13, 2018 - 12:15:40 PM

File

cla18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01856516, version 1

Citation

Victor Codocedo, Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli. Characterizing Covers of Functional Dependencies using FCA. CLA 2018 - The 14th International Conference on Concept Lattices and Their Applications, Jun 2018, Olomouc, Czech Republic. pp.279-290. ⟨hal-01856516⟩

Share

Metrics

Record views

347

Files downloads

136