Search
Documentation Center

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
Objetos digitales
Collection: Articles
Title: KeyFinder : An Efficient Minimal Keys Finding Algorithm For Relational Databases / Moussa DembaAuthor: Demba, Moussa ‌
Notes: 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. Related records: En: Revista Iberoamericana de Inteligencia Artificial. - : IBERAMIA, Sociedad Iberoamericana de Inteligencia Artificial , 2018- = ISSN 1988-3064. - 04/10/2021 Volumen 24 Número 68 - octubre 2021 , p. 37-52Materia / lugar / evento: Inteligencia artificial ‌Algoritmos ‌Other categories: 922.134
Rights: La copia digital se distribuye bajo licencia "Attribution 4.0 International (CC BY NC 4.0)"
‌ See issue detail