@article{Demba_2021, title={KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases}, volume={24}, url={http://journal.iberamia.org/index.php/intartif/article/view/597}, DOI={10.4114/intartif.vol24iss68pp37-52}, abstractNote={<p>In relational databases, it is essential to know all minimal keys since the concept of database normaliza-<br>tion is based on keys and functional dependencies of a relation schema. Existing algorithms for determining keys<br>or computing the closure of arbitrary sets of attributes are generally time-consuming. In this paper we present an<br>eï¬ƒcient algorithm, called KeyFinder, for solving the key-ï¬nding problem. We also propose a more direct method<br>for computing the closure of a set of attributes. KeyFinder is based on a powerful proof procedure for ï¬nding<br>keys called tableaux. Experimental results show that KeyFinder outperforms its predecessors in terms of search<br>space and execution time.</p>}, number={68}, journal={Inteligencia Artificial}, author={Demba, Moussa}, year={2021}, month={Sep.}, pages={37–52} }