Define partial, alternate,artificial,compound &natural key, Database Management System

Assignment Help:

 

Partial Key: It is a group of attributes that can uniquely identify small entities and that are related to same base entity. It is sometime named as Discriminator.

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

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

 Compound Key: If no single data component uniquely identifies occurrences within a developed, then combining multiple components to make a distinct identifier for the construct is called as creating a compound key.

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

 


Related Discussions:- Define partial, alternate,artificial,compound &natural key

Advanced database systems, Consider an information system designed for an o...

Consider an information system designed for an online company which provides IT products and services These include desktops, laptops, networking products, IT books, parts, and

Operator precedence-data manipulation language, Operator Precedence The...

Operator Precedence The basic operators used in SQL are * /   - + Operators of the similar priority are evaluated From Left to right Parentheses are used to force priorit

Example of grant create session to mca12, Example -GRANT CREATE SESSION TO ...

Example -GRANT CREATE SESSION TO MCA12; (This command gives system level permission on creating a session - not portable) GRANT SELECT ON EMP TO MCA12; (Object level permi

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

Optimistic concurrency contents -write-set(t), write-set(T): Each data ite...

write-set(T): Each data items that are written by a transaction T

Primary index, Primary index A primary index is a file that has a sorte...

Primary index A primary index is a file that has a sorted series of records having two columns: a block address for that key field in the data file; and the ordering key field.

Create a subroutine, 1. Create a subroutine that does the remote blast on t...

1. Create a subroutine that does the remote blast on the file protein.fa. 2. Pass that returned files from the blast to another subroutine that parses the output and sends it to

Differentiate between natural join and outer join, Differentiate between na...

Differentiate between natural join and outer join? Natural join is a binary operator which is written as (R * S) where as R and S are relations. The output of the natural join

Er digrams, what is er digram given that example of hospital,bank and libra...

what is er digram given that example of hospital,bank and library er digram.

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