What are partial and natural key, Database Management System

Assignment Help:

What are partial, alternate,, artificial, compound and natural key?

Partial Key: It is a set of attributes that can uniquely recognize weak entities and that are related to same owner entity. It is sometime known as Discriminator.

Alternate Key: All Candidate Keys excluding the Primary Key are called as Alternate Keys.

Artificial Key: If no obvious key either stands alone or compound is available, then the last resort is to simply make a key, by assigning a unique number to every record or occurrence. Then this is known as developing an artificial key.

Compound Key: If no single data element uniquely identifies occurrences within a construct, then combining multiple elements to make a unique identifier for the construct is known as creating a compound key.

Natural Key: When one of the data elements stored within a construct is utilized as the primary key, then it is known as the natural key.

 


Related Discussions:- What are partial and natural key

The result of the union operation between r1 and r2, The result of the UNIO...

The result of the UNION operation between R1 and R2 is a relation that includes? The result of the operation between R1 and R2 includes all the tuples of R1 and R2 which have c

Super keys, A super key is an attribute or set of attributes used to recogn...

A super key is an attribute or set of attributes used to recognize the records uniquely in a relation. For instance, in the Relation PERSON defines earlier PERSON_ID is a super

What is rigorous two phase locking protocol, Differentiate strict two phase...

Differentiate strict two phase locking protocol and rigorous two phase locking protocol. In strict two phase locking protocol all exclusive mode locks taken by a transaction is

Define deadlock detection, Define Deadlock detection If a system does ...

Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm

What are deadlocks, What are deadlocks?  How can they be avoided?  Ans:...

What are deadlocks?  How can they be avoided?  Ans: Deadlock considers to a particular condition when two or more processes are every waiting for another to release a resource,

Define boyce codd normal form, Define Boyce codd normal form A relation...

Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

Objectives-transactions and concurrency management, Objectives After Re...

Objectives After Reading this part, you should be able to: Explain the term CONCURRENCY; Describe the term transaction and concurrent transactions; Talk about co

What are the functions of an accumulator, What are the functions of an accu...

What are the functions of an accumulator? The accumulator is the register associated with the ALU operations and sometimes I/O operations. It is an integral part of ALU. It hol

HRM, is Chipo carrying his baby

is Chipo carrying his baby

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.

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