Open AccessKeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases
Author(s) -
Moussa Demba
Publication year - 2021
Publication title -
inteligencia artificial
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.149
H-Index - 12
eISSN - 1988-3064
pISSN - 1137-3601
DOI - 10.4114/intartif.vol24iss68pp37-52
Subject(s) - computer science , relational database , schema (genetic algorithms) , functional dependency , closure (psychology) , key (lock) , set (abstract data type) , database , relation (database) , algorithm , relational model , theoretical computer science , data mining , information retrieval , programming language , computer security , economics , market economy
In relational databases, it is essential to know all minimal keys since the concept of database normaliza-tion is based on keys and functional dependencies of a relation schema. Existing algorithms for determining keysor computing the closure of arbitrary sets of attributes are generally time-consuming. In this paper we present anefficient algorithm, called KeyFinder, for solving the key-ï¬nding problem. We also propose a more direct methodfor computing the closure of a set of attributes. KeyFinder is based on a powerful proof procedure for ï¬ndingkeys called tableaux. Experimental results show that KeyFinder outperforms its predecessors in terms of searchspace and execution time.