A new closure algorithm based in logic: SLFD-Closure versus classical closures

 

Abstract

The field of application of closure systems goes from theoretical areas as algebra or geometry to practical areas as databases and artificial intelligence. In these practical areas, a kind of constraint named functional dependencies have an important role. Given a set of attributes X and a set of functional dependencies $\Gamma$, the computation of the closure of $X$ for $\Gamma$, denoted as $X^+$ is abundantly used in artificial intelligence and database literature and is one of the key points in many problems: knowledge compilation, redundant constraint elimination, query optimization, the finding key problem, etc. We outline the main classical closure algorithms and we compare them with a novel algorithm named SLFD-Closure. We show an empirical study with the execution of the closure algorithms, and we establish that SLFD-Closure is the fastest.

Citation

Please, cite this work as:

[Mor+06] Á. Mora, G. Aguilera, M. Enciso, et al. “A new closure algorithm based in logic: SLFD-Closure versus classical closures”. In: Inteligencia Artif. 10.31 (2006), pp. 31-40. URL: http://journal.iberamia.org/index.php/ia/article/view/503/article%20%281%29.pdf.

BibTeX

@Article{Mora2006,
     author = {{’A}ngel Mora and Gabriel Aguilera and Manuel Enciso and Pablo Cordero and Inmaculada Perez {de Guzm{’a}n}},
     journal = {Inteligencia Artif.},
     title = {A new closure algorithm based in logic: SLFD-Closure versus classical closures},
     year = {2006},
     number = {31},
     pages = {31–40},
     volume = {10},
     abstract = {The field of application of closure systems goes from theoretical areas as algebra or geometry to practical areas as databases and artificial intelligence. In these practical areas, a kind of constraint named functional dependencies have an important role. Given a set of attributes X and a set of functional dependencies
    $\Gamma$, the computation of the closure of $X$ for $\Gamma$, denoted as $X^+$ is abundantly used in artificial intelligence and database literature and is one of the key points in many problems: knowledge compilation, redundant constraint elimination, query optimization, the finding key problem, etc. We outline the main classical closure algorithms and we compare them with a novel algorithm named SLFD-Closure. We show an empirical study with the execution of the closure algorithms, and we establish that SLFD-Closure is the fastest.},
     bibsource = {dblp computer science bibliography, https://dblp.org},
     biburl = {https://dblp.org/rec/journals/aepia/MoraAECG06.bib},
     timestamp = {Fri, 26 May 2023 01:00:00 +0200},
     url = {http://journal.iberamia.org/index.php/ia/article/view/503/article%20%281%29.pdf},
}