KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases
Objetos digitales
| Tag | 1 | 2 | Valor |
|---|---|---|---|
| LDR | 00000cab a2200000 4500 | ||
| 001 | MAP20210031311 | ||
| 003 | MAP | ||
| 005 | 20220911185810.0 | ||
| 008 | 211028e20211004esp|||p |0|||b|spa d | ||
| 040 | $aMAP$bspa$dMAP | ||
| 084 | $a922.134 | ||
| 100 | 1 | $0MAPA20210034794$aDemba, Moussa | |
| 245 | 1 | 0 | $aKeyFinder$b: An Efficient Minimal Keys Finding Algorithm For Relational Databases$cMoussa Demba |
| 520 | $aIn 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. | ||
| 540 | $aLa copia digital se distribuye bajo licencia "Attribution 4.0 International (CC BY NC 4.0)"$f$uhttps://creativecommons.org/licenses/by-nc/4.0$964 | ||
| 650 | 4 | $0MAPA20080611200$aInteligencia artificial | |
| 650 | 4 | $0MAPA20080553128$aAlgoritmos | |
| 773 | 0 | $wMAP20200034445$g04/10/2021 Volumen 24 Número 68 - octubre 2021 , p. 37-52$x1988-3064$tRevista Iberoamericana de Inteligencia Artificial$d : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018- | |
| 856 | $qapplication/pdf$w899$yRecurso electrónico / Electronic resource |