KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases

KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases

Imagem do registro

Coleção: Artigos

Título: KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases / Moussa Demba
Notas: 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.
Materia / lugar / evento: Inteligencia artificial
Algoritmos
Outras classificações: 922.134

Direitos: La copia digital se distribuye bajo licencia "Attribution 4.0 International (CC BY NC 4.0)": https://creativecommons.org/licenses/by-nc/4.0