An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema

@article{Saiedian1996AnEA,
  title={An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema},
  author={Hossein Saiedian and Thomas Spencer},
  journal={Comput. J.},
  year={1996},
  volume={39},
  pages={124-132}
}
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 usingattribute graphsis then provided which allows a uniform and simplified solution to find all possible keys of a relational database schema when the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Switching-algebraic algorithmic derivation of candidate keys in relational databases

2016 International Conference on Emerging Trends in Communication Technologies (ETCT) • 2016
View 6 Excerpts
Highly Influenced

Autonomous sets for the hypergraph of all canonical covers

Annals of Mathematics and Artificial Intelligence • 2011
View 4 Excerpts
Highly Influenced

An efficient algorithm for 3NF determination

Inf. Sci. • 2004
View 7 Excerpts
Highly Influenced

Detecting unique column combinations on dynamic data

2014 IEEE 30th International Conference on Data Engineering • 2014
View 1 Excerpt

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…