Search

KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases

KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases
Recurso electrónico / Electronic resource
MARC record
Tag12Value
LDR  00000cab a2200000 4500
001  MAP20210031311
003  MAP
005  20220911185810.0
008  211028e20211004esp|||p |0|||b|spa d
040  ‎$a‎MAP‎$b‎spa‎$d‎MAP
084  ‎$a‎922.134
1001 ‎$0‎MAPA20210034794‎$a‎Demba, Moussa
24510‎$a‎KeyFinder‎$b‎: An Efficient Minimal Keys Finding Algorithm For Relational Databases‎$c‎Moussa Demba
520  ‎$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.
540  ‎$a‎La copia digital se distribuye bajo licencia "Attribution 4.0 International (CC BY NC 4.0)"‎$f‎‎$u‎https://creativecommons.org/licenses/by-nc/4.0‎$9‎64
650 4‎$0‎MAPA20080611200‎$a‎Inteligencia artificial
650 4‎$0‎MAPA20080553128‎$a‎Algoritmos
7730 ‎$w‎MAP20200034445‎$g‎04/10/2021 Volumen 24 Número 68 - octubre 2021 , p. 37-52‎$x‎1988-3064‎$t‎Revista Iberoamericana de Inteligencia Artificial‎$d‎ : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018-
856  ‎$q‎application/pdf‎$w‎899‎$y‎Recurso electrónico / Electronic resource