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

State the process of inheritance adjustment, Inheritance Adjustment As...

Inheritance Adjustment As in object oriented analysis and design terms inheritance defines a relationship between classes, where as one class shares structure or behaviour def

Explain the equijoin, Explain the θ-join and equijoin Refer tables Car ...

Explain the θ-join and equijoin Refer tables Car and Boat which list models of cars and boats and their relevant prices. Assume a customer wants to buy a car and a boat, but sh

3NF, Winfield is a small city with a population of 22,000 with buses serves...

Winfield is a small city with a population of 22,000 with buses serves three routes in Winfield and neighboring areas. As the city’s IT director, you have been asked to set up an i

Distinguish among a datareader class and a dataset class, Question (a) ...

Question (a) Concurrent access to data from a database is a normal part of application program usage. Describe three approaches to concurrency control (b) Distinguish among

Relational algebra operators, Question 1 Draw a Data Flow Diagram for a...

Question 1 Draw a Data Flow Diagram for a University scenario Question 2 Discuss the following with suitable examples Relational Algebra Operators Database Pla

Explain the concept of two-phase locking, Explain the Concept of Two-phase ...

Explain the Concept of Two-phase Locking It concerns the positions of locking and unlocking operations in each transaction.  In this protocol every transaction issue lock and u

What is a hashing function, What is a hashing function?  What are the prope...

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.      Ans:  Hashing function is a method

Define thomas write rule, Define Thomas write rule Thomas' write rule: ...

Define Thomas write rule Thomas' write rule: The Thomas' write rule is a modification of timestamp-ordering protocol for concurrency control. Assume that transaction T i issue

Example of ancestry database , Ancestry database records information about ...

Ancestry database records information about family trees . Following information is recorded about each person: FIRSTNAME first name SURNAME surname MNAME maiden name (if

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