Explain the terms primary key, candidate key, alternate key, Database Management System

Assignment Help:

Explain the terms primary key, candidate key, alternate key and secondary key. In the given table identify every key?

STUDENT(SID,Regno, Name, City)

Primary Key: The primary key of a relational table uniquely identify every record in the table. It can either be a general attribute (or set of attributes) which is guaranteed to be unique (such as Social Security Number in a table along with no more than one record per person) or it could be provided through the DBMS (such as a globally unique identifier, or GUID, in Microsoft SQL Server).

Candidate Key: A candidate key is a combination of attributes in which can be uniquely used to recognize a database record without any extraneous data. Each table may have one or more candidate keys. One of these candidate keys is chosen as the table primary key.

Alternate Key: An alternate key (or secondary key) is any candidate key that is not selected to be the primary key (PK).

For instance, a relational database along with a table "employee" could have attributes like

"employee_id", "bank_acct_no", and so on. In this case, both "employee_id" and
"bank_acct_no" serve as unique identifiers for a given employee, and could therefore arguably be used for a primary key. Therefore, both of them are known as "candidate keys". If, for example, "bank_acct_no" was chosen as the primary key, "employee_id" would become the alternate key

Secondary Key: Same as above

In above table SID is a primary key, SID and Regno are candidate keys and SIDor Regno are alternate or secondary key.


Related Discussions:- Explain the terms primary key, candidate key, alternate key

Create a data flow diagram, For your chosen project, you need to identify t...

For your chosen project, you need to identify the current problem that you wish your project to solve.  Produce a Problem Statement.  The Problem Statement should explain the purpo

Mappings between levels and data independence, Mappings between Levels and ...

Mappings between Levels and Data Independence The 3 levels of abstraction in the database do not exist separately of each other. There must be some correspondence, or mapping

Explain the project-join normal form, Explain the Project-Join normal form ...

Explain the Project-Join normal form A relation R is in PJNF along with respect to a set of functional dependencies D if for all join dependencies of the outline *(R 1 , R 2 ,

Dataware house(job scheduling strategy), Define a job scheduling strategy t...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pictori

Define one-way associations using pointers, One-way Associations If an...

One-way Associations If an association is only traversed in single direction, then it is known as one-way association. It is implemented as a pointer or an attribute which con

What are views explain how views are different from tables, What are views?...

What are views? Explain how views are different from tables? A view in SQL terminology is a one table in which is derived from other tables. These other tables could be base t

Group by clauses-data manipulation language, Group By clauses  • It is ...

Group By clauses  • It is used to group database tuples on the basis of definite common attribute value like as employees of a department. WHERE clause still can be used

Domain constraints, Domain Constraints Domain constraints are primarily...

Domain Constraints Domain constraints are primarily formed for defining the logically correct values for an attribute of a relation. The relation allows attributes of a relatio

Illustrate the state model for the atm class, Illustrate the State model fo...

Illustrate the State model for the ATM class let us take state model for the ATM class given below in Figure showing state model of the ATM class and the pseudo code derived fr

Referential integrity constraint - relational constraints, It defines that ...

It defines that the tuple in one relation that refers to another relation must refer to an existing tuple in that relation. This constraint is states on two relations (not essentia

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