Candidate keys, Database Management System

Super keys of a relation can have extra attributes. Candidate keys are minimal super key, i.e. such a key have no extraneous attribute. An attribute is known as extraneous if even after removing it from the key, create the remaining attributes still has the properties of a key.

The following properties must be satisfied by the candidate keys:

  • A candidate key's value must exist. It cannot be null. (This is also known as entity integrity rule)
  • A candidate key has to be unique.
  • A candidate key is a smallest set of attributes.
  • The value of a candidate key has to be stable. Its value cannot change outside the control of the system.

A relation can have more than single candidate keys and one of them can be chosen as a primary key.

For instance, in the relation PERSON the two likely candidate keys are PERSON- ID and NAME (assuming unique names in the table). PERSON-ID may be taken as the primary key.

Posted Date: 3/6/2013 5:24:18 AM | Location : United States







Related Discussions:- Candidate keys, Assignment Help, Ask Question on Candidate keys, Get Answer, Expert's Help, Candidate keys Discussions

Write discussion on Candidate keys
Your posts are moderated
Related Questions
Give an example of enforcement in Typing. You can understand the idea of enforcement as it makes sure objects of dissimilar classes may not be interchanged as below:  Exampl

Failures and Recovery In practice various things might occur to prevent a transaction from completing. Recovery methods are used to bring database, which does not satisfy consi


What is known as heap file organization? In the heap file organization, any record can be placed anywhere in the file where there is space for the record. There is no ordering

Illustrate different types of Locks in SQL Server. There are three kinds of locks in SQL Server i.) Shared locks - These are used for operations which don't allow any update

using the invoice table shown below,write the relational schema,draw a dependencies,inclunding all partial and transitive dependencies.assume that the table does not contain repeat

What are the different approaches for database design? There are two basic approaches for database design which are as follows: Attribute driven: It compiles a list of att

Explain data independence ? Data independence is the capacity to modify the schema at one stage of a database system without having to change the schema at the further level.

What are three components of the schema architecture proposed by ANSI/SPARC? The three component schema architecture proposed by ANSI/SPARC is as given below: External sche

Which data type can store unstructured data? Raw data type can store unstructured data.