Candidate keys, Database Management System

Assignment Help:

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.


Related Discussions:- Candidate keys

Describe the different raid levels, Describe the different RAID levels.  Di...

Describe the different RAID levels.  Discuss the choices of the different RAID levels for different applications.          Ans:   There are several combinations of these approa

Ldb hierarchy there should exist one get statement, It is mandatory that fo...

It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False.  It is not essential.

What is average response time, What is average response time? The avera...

What is average response time? The average response time is that the average time for a transaction to be done after it has been submitted.

Determine the persistent object, Determine the Persistent object Persis...

Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap

Describe hashing in dbms, Describe Hashing in DBMS? Hashing: Hashing ...

Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))

Homework, can you resolve this for me please? Database Management Systems ...

can you resolve this for me please? Database Management Systems Homework 1 The following relations are given (primary keys are underlined): PLAY-ACTOR(AId, Name, Nationality, Birt

OLD HOME POLICIES, Write an sql statement to find what is the percentage of...

Write an sql statement to find what is the percentage of home policies which are from the state of Arizona out of all Home policies by Policy Value.

For known, What are the function of DBA?

What are the function of DBA?

Insert - referential integrity, The insertion of a tuple in the aim of refe...

The insertion of a tuple in the aim of reference does not cause any destruction. Though, insertion of a tuple in the relation in which, we has the foreign key, for instance, in ASS

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd