A new closure algorithm based in logic: SLFD-Closure versus classical closures
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Asociación Española para la Inteligencia Artificial
2006
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876483414157164544 |
|---|---|
| author | M. Enciso |
| author_facet | M. Enciso |
| contents | A new closure algorithm based in logic: SLFD-Closure versus classical closures M. Enciso P. Cordero I.P. de Guzmán A. Mora G. Aguilera Ingeniería Logic Closure Functional Dependencies 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. 2006 artículo científico 1137-3601 https://www.redalyc.org/articulo.oa?id=92503104 en http://www.redalyc.org/revista.oa?id=925 Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial application/pdf Asociación Española para la Inteligencia Artificial Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.31 Vol.10 |
| format | Artículo científico |
| id | redalyc_92503104 |
| institution | Redalyc |
| language | en |
| publishDate | 2006 |
| publisher | Asociación Española para la Inteligencia Artificial |
| spellingShingle | A new closure algorithm based in logic: SLFD-Closure versus classical closures M. Enciso Ingeniería Logic Closure Functional Dependencies A new closure algorithm based in logic: SLFD-Closure versus classical closures M. Enciso P. Cordero I.P. de Guzmán A. Mora G. Aguilera Ingeniería Logic Closure Functional Dependencies 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. 2006 artículo científico 1137-3601 https://www.redalyc.org/articulo.oa?id=92503104 en http://www.redalyc.org/revista.oa?id=925 Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial application/pdf Asociación Española para la Inteligencia Artificial Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.31 Vol.10 |
| title | A new closure algorithm based in logic: SLFD-Closure versus classical closures |
| topic | Ingeniería Logic Closure Functional Dependencies |
| url | https://www.redalyc.org/articulo.oa?id=92503104 |