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

Backward recovery (undo), Backward Recovery (UNDO): In this system the unco...

Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone.  Instead the system is reset to the last consistent state of databa

What is a virtual table that draws its data from the result, What is a virt...

What is a virtual table that draws its data from the result of an SQL SELECT statement? View is a virtual table that draws its data from the result of an SQL SELECT statement.

Where does view definition stored, Where does view definition stored? ...

Where does view definition stored? A view definition is permanently stored as part of the database.

What are the failures of controlling events between objects, What are the f...

What are the failures of Controlling Events Between Objects  Failure Unintentional termination of system. Several possible causes: failure of system hardware, o

Explain data sublangauges, Explain Data Sublangauges ? Data sublanguage...

Explain Data Sublangauges ? Data sublanguage: In relational database theory, the term sublanguage, first used for this purpose through E. F. Codd in the year of 1970, refers t

Having clause-data manipulation language, Having clause This clause...

Having clause This clause is used for producing conditions on grouped information. Example: Find maximum salary and department number of those departments where maxim

Post vbulletin hack and new server problem, Project Description: My VBul...

Project Description: My VBulletin forum was hacked, and soon after my server machine died. So, I'm now on a new machine, and I think that I've taken care of 99% of the hacking..

When are two schedules said to be view equivalent, When are two schedules s...

When are two schedules said to be view equivalent?     Ans: Two schedules that is denoted as S and S' are said to be view equivalent if the subsequent three conditions are met

What is known as fudge factor, What is known as fudge factor? The numbe...

What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu

Explain the object-oriented decomposition, Explain the Object-oriented deco...

Explain the Object-oriented decomposition Object-oriented decomposition targets at identifying individual sovereign objects that encapsulate both a state and certain behavio

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