A relational model of data for large shared data banks
Communications of the ACM - Special 25th Anniversary Issue
Finding candidate keys for relational data bases
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
GORDIAN: efficient and scalable discovery of composite keys
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Determining All Candidate Keys Based on Karnaugh Map
ICIII '09 Proceedings of the 2009 International Conference on Information Management, Innovation Management and Industrial Engineering - Volume 04
Fundamentals of Database Systems
Fundamentals of Database Systems
Ideal non-deterministic operators as a formal framework to reduce the key finding problem
International Journal of Computer Mathematics - APPLICATIONS OF COMPUTATIONAL MATHEMATICS IN SCIENCE AND ENGINEERING
| Hi-index | 0.00 |
Wastl introduced for first time a tableaux-like method based on an inference system for deriving all minimal keys from a relational schema. He introduced two inference rules and built an automated method over them. In this work we tackle the key finding problem with a tableaux method, but we will use two inference rules inspired by the Simplification Logic for Functional Dependencies. Wastl's method requires the input to be a set of functional dependencies (FDs) with atomic right hand sides. Therefore, it is necessary to apply fragmentation rule with the consequent increasing of the input. The main novelty of our rules is that they deal with generalized formulas, avoiding the fragmentation needed in the former tableaux. Finally we illustrate the advantages of our new tableaux method with an experiment.