An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
Hossein Saiedian · The Computer Journal · 1996
We provide an efficient algorithm for computing the candidate keys of a relational database schema. The algorithm exploits the ‘arrangement’ of attributes in the functional dependencies to determine which attributes are essential and useful for determining the keys and which attributes should not be considered. A more generalized algorithm using attribute graphs is then provided which allows a uniform and simplified solution to find all possible keys of a relational database schema when the attribute graph of Functional Dependencies (FDs) is not strongly connected.