Authors: F BenitoPicazo P Cordero M Enciso A Mora
Publish Date: 2016/01/14
Volume: 73, Issue: 1, Pages: 75-87
Abstract
In this paper we present an innovative method to solve the minimal keys problem strongly based on the Simplification Logic for Functional Dependencies This novel method improves previous logicbased methods by reducing in a significant degree the size of the search space this problem deals with Furthermore the new method has been designed to easily fit within a parallel implementation thereby increasing the boundaries current methods can reachSupported by Grants TIN201128084 and TIN201459471P of the Science and Innovation Ministry of Spain cofunded by the European Regional Development Fund ERDF The authors thankfully acknowledge the computer resources technical expertise and assistance provided by the SCBI Supercomputing and Bioinnovation center of the University of Málaga Andalucía Tech
Keywords: