While most database textbooks provide formal and informal definitions for the candidate key of a relational database scheme, none provide a simple approach for finding the keys. In this paper, we present a simple algorithm that can be used by the students to correctly and efficiently identify the candidate keys of a relational database schema. The algorithm examines the position of attributes in the functional dependencies to determine which attributes are essential and useful for determining the keys and which attributes should be ignored. A key is found by computing the closure of essential attributes.
"Teaching Students How to Find the Candidate Keys of a Relational Database Schema,"
Journal of Information Systems Education: Vol. 8
Available at: https://aisel.aisnet.org/jise/vol8/iss1/7
When commenting on articles, please be friendly, welcoming, respectful and abide by the AIS eLibrary Discussion Thread Code of Conduct posted here.