A new closure algorithm based in logic: SLFD-Closure versus classical closures.
Ángel Mora, G. Aguilera, Manuel Enciso, Pablo Cordero, I. P. de Guzmán · INTELIGENCIA ARTIFICIAL · 2006
"The ¯eld of application of closure systems goes from theoretical areas as algebra or geometry to practicalareas as databases and arti¯cial intelligence. In these practical areas, a kind of constraint named functionaldependencies have an important role. Given a set of attributes X and a set of functional dependencies¡, the computation of the closure of X for ¡, denoted as X+ is abundantly used in arti¯cial intelligenceand database literature and is one of the key points in many problems: knowledge compilation, redundantconstraint elimination, query optimization, the ¯nding key problem, etc. We outline the main classical closurealgorithms and we compare them with a novel algorithm named SLFD-Closure. We show an empirical studywith the execution of the closure algorithms, and we establish that SLFD-Closure is the fastest."