KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<rdf:Description>
<dc:creator>Demba, Moussa</dc:creator>
<dc:date>2021-10-04</dc:date>
<dc:description xml:lang="es">Sumario: In relational databases, it is essential to know all minimal keys since the concept of database normalization is based on keys and functional dependencies of a relation schema. Existing algorithms for determining keys or computing the closure of arbitrary sets of attributes are generally time-consuming. In this paper we present an efficient algorithm, called KeyFinder, for solving the KeyFinder problem. We also propose a more direct method for computing the closure of a set of attributes. KeyFinder is based on a powerful proof procedure for finding keys called tableaux. Experimental results show that KeyFinder outperforms its predecessors in terms of search space and execution time. </dc:description>
<dc:format xml:lang="en">application/pdf</dc:format>
<dc:identifier>https://documentacion.fundacionmapfre.org/documentacion/publico/es/bib/177584.do</dc:identifier>
<dc:language>spa</dc:language>
<dc:rights xml:lang="es">https://creativecommons.org/licenses/by-nc/4.0</dc:rights>
<dc:subject xml:lang="es">Inteligencia artificial</dc:subject>
<dc:subject xml:lang="es">Algoritmos</dc:subject>
<dc:type xml:lang="es">Artículos y capítulos</dc:type>
<dc:title xml:lang="es">KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases</dc:title>
<dc:relation xml:lang="es">En: Revista Iberoamericana de Inteligencia Artificial. -  : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018- = ISSN 1988-3064. - 04/10/2021 Volumen 24 Número 68 - octubre 2021 , p. 37-52</dc:relation>
</rdf:Description>
</rdf:RDF>