Keys - relational database integrity, Database Management System

Assignment Help:

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties:

(1)        Uniqueness:                No two distinct tuples in R have the similar value for the candidate key

(2)        Irreducible:                 No correct subset of the candidate key has the uniqueness property that is the candidate key.

Each relation must have at least one candidate key which cannot be reduced more. Duplicate tuples are not permitted in relations. Any candidate key can also be a composite key. For instance, (student-id + course-id) together can create the candidate key of a relation known as marks (student-id, course-id, marks).

Let us review the properties of a candidate key.

Properties of a candidate key

  • A candidate key has to be unique and irreducible
  • A candidate might be involving one or more than one attributes. A candidate key that contains more than one attribute is said to be composite.

But why are we interested in candidate keys?

Candidate keys are essential because they give the basic tuple-level identification mechanism in a relational system.

For instance, if the enrolment number is the candidate key of a STUDENT relation, then the solution of the query: "Find student details from the STUDENT relation having enrolment number A0123" will output at most one tuple.


Related Discussions:- Keys - relational database integrity

Foreign keys , Foreign Keys and NULL Let us take the relation:         ...

Foreign Keys and NULL Let us take the relation:                 DEPT DEPT ID DNAME BUDGET D1 M

Locks, Locks: Serialisabilty is just a test whether a given interleaved sch...

Locks: Serialisabilty is just a test whether a given interleaved schedule is ok or has a concurrency related trouble. Though, it does not make sure that the interleaved concurrent

How to design a formal and exact model, How to design a formal and exact mo...

How to design a formal and exact model How to design a formal and exact model of real-world problems by applying findings of analysis phase of OMT. The object design phase find

Define physical and logical data independence, Define physical and logical ...

Define physical and logical data independence. How does this architecture help in achieving these? Data independence entails that change in one view must not need a change in t

Dbms, You are managing the following database system: • DBMS: Oracle 11g ...

You are managing the following database system: • DBMS: Oracle 11g • OS: Sun Solaris • System architecture: Web-based application using ASP.Net • Purpose of Server: HR managem

Log based recovery, under what condition log based recovery is feasible?

under what condition log based recovery is feasible?

DISTIBUTED DATABASE, Define physical image of a global relation at a site

Define physical image of a global relation at a site

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

Explain the two types of participation constraint., Explain the two types o...

Explain the two types of participation constraint. 1. Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

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