KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases

<?xml version="1.0" encoding="UTF-8"?><modsCollection xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-8.xsd">
<mods version="3.8">
<titleInfo>
<title>KeyFinder</title>
<subTitle>: An Efficient Minimal Keys Finding Algorithm For Relational Databases</subTitle>
</titleInfo>
<name type="personal" usage="primary" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20210034794">
<namePart>Demba, Moussa</namePart>
<nameIdentifier>MAPA20210034794</nameIdentifier>
</name>
<typeOfResource>text</typeOfResource>
<genre authority="marcgt">periodical</genre>
<originInfo>
<place>
<placeTerm type="code" authority="marccountry">esp</placeTerm>
</place>
<dateIssued encoding="marc">2021</dateIssued>
<issuance>serial</issuance>
</originInfo>
<language>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</language>
<physicalDescription>
<form authority="marcform">print</form>
<internetMediaType>application/pdf</internetMediaType>
</physicalDescription>
<abstract displayLabel="Summary">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. </abstract>
<accessCondition type="use and reproduction">La copia digital se distribuye bajo licencia "Attribution 4.0 International (CC BY NC 4.0)"</accessCondition>
<note type="statement of responsibility">Moussa Demba</note>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080611200">
<topic>Inteligencia artificial</topic>
</subject>
<subject xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="MAPA20080553128">
<topic>Algoritmos</topic>
</subject>
<classification authority="">922.134</classification>
<relatedItem type="host">
<titleInfo>
<title>Revista Iberoamericana de Inteligencia Artificial</title>
</titleInfo>
<originInfo>
<publisher> : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018-</publisher>
</originInfo>
<identifier type="issn">1988-3064</identifier>
<identifier type="local">MAP20200034445</identifier>
<part>
<text>04/10/2021 Volumen 24 Número 68 - octubre 2021 , p. 37-52</text>
</part>
</relatedItem>
<recordInfo>
<recordContentSource authority="marcorg">MAP</recordContentSource>
<recordCreationDate encoding="marc">211028</recordCreationDate>
<recordChangeDate encoding="iso8601">20220911185810.0</recordChangeDate>
<recordIdentifier source="MAP">MAP20210031311</recordIdentifier>
<languageOfCataloging>
<languageTerm type="code" authority="iso639-2b">spa</languageTerm>
</languageOfCataloging>
</recordInfo>
</mods>
</modsCollection>