KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases

<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
  <record>
    <leader>00000cab a2200000   4500</leader>
    <controlfield tag="001">MAP20210031311</controlfield>
    <controlfield tag="003">MAP</controlfield>
    <controlfield tag="005">20220911185810.0</controlfield>
    <controlfield tag="008">211028e20211004esp|||p      |0|||b|spa d</controlfield>
    <datafield tag="040" ind1=" " ind2=" ">
      <subfield code="a">MAP</subfield>
      <subfield code="b">spa</subfield>
      <subfield code="d">MAP</subfield>
    </datafield>
    <datafield tag="084" ind1=" " ind2=" ">
      <subfield code="a">922.134</subfield>
    </datafield>
    <datafield tag="100" ind1="1" ind2=" ">
      <subfield code="0">MAPA20210034794</subfield>
      <subfield code="a">Demba, Moussa</subfield>
    </datafield>
    <datafield tag="245" ind1="1" ind2="0">
      <subfield code="a">KeyFinder</subfield>
      <subfield code="b">: An Efficient Minimal Keys Finding Algorithm For Relational Databases</subfield>
      <subfield code="c">Moussa Demba</subfield>
    </datafield>
    <datafield tag="520" ind1=" " ind2=" ">
      <subfield code="a">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. </subfield>
    </datafield>
    <datafield tag="540" ind1=" " ind2=" ">
      <subfield code="a">La copia digital se distribuye bajo licencia "Attribution 4.0 International (CC BY NC 4.0)"</subfield>
      <subfield code="f"/>
      <subfield code="u">https://creativecommons.org/licenses/by-nc/4.0</subfield>
      <subfield code="9">64</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="4">
      <subfield code="0">MAPA20080611200</subfield>
      <subfield code="a">Inteligencia artificial</subfield>
    </datafield>
    <datafield tag="650" ind1=" " ind2="4">
      <subfield code="0">MAPA20080553128</subfield>
      <subfield code="a">Algoritmos</subfield>
    </datafield>
    <datafield tag="773" ind1="0" ind2=" ">
      <subfield code="w">MAP20200034445</subfield>
      <subfield code="g">04/10/2021 Volumen 24 Número 68 - octubre 2021 , p. 37-52</subfield>
      <subfield code="x">1988-3064</subfield>
      <subfield code="t">Revista Iberoamericana de Inteligencia Artificial</subfield>
      <subfield code="d"> : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018-</subfield>
    </datafield>
    <datafield tag="856" ind1=" " ind2=" ">
      <subfield code="q">application/pdf</subfield>
      <subfield code="w">899</subfield>
      <subfield code="y">Recurso electrónico / Electronic resource</subfield>
    </datafield>
  </record>
</collection>