KeyFinder: An Efficient Minimal Keys Finding Algorithm For Relational Databases
Open Access
- 30 September 2021
- journal article
- research article
- Published by IBERAMIA: Sociedad Iberoamericana de Inteligencia Artificial in INTELIGENCIA ARTIFICIAL
- Vol. 24 (68), 37-52
- https://doi.org/10.4114/intartif.vol24iss68pp37-52
Abstract
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 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 key-ï¬nding 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 ï¬nding keys called tableaux. Experimental results show that KeyFinder outperforms its predecessors in terms of search space and execution time.Keywords
This publication has 6 references indexed in Scilit:
- LinCbO: Fast algorithm for computation of the Duquenne-Guigues basisInformation Sciences, 2021
- Minimal generators, an affordable approach by means of massive computationThe Journal of Supercomputing, 2018
- Reducing the search space by closure and simplification paradigmsThe Journal of Supercomputing, 2016
- A tableaux-like method to infer all minimal keysLogic Journal of the IGPL, 2014
- Closure via functional dependence simplificationInternational Journal of Computer Mathematics, 2012
- An efficient algorithm for 3NF determinationInformation Sciences, 2004