Keys - relational database integrity, Database Management System

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.

Posted Date: 3/6/2013 6:30:24 AM | Location : United States







Related Discussions:- Keys - relational database integrity, Assignment Help, Ask Question on Keys - relational database integrity, Get Answer, Expert's Help, Keys - relational database integrity Discussions

Write discussion on Keys - relational database integrity
Your posts are moderated
Related Questions

Illustrate the term- Abstracting Out Common Behaviour Inheritance is not every time recognised during analysis phase of development, thus it is necessary to re-evaluate object

Consider the subsequent relation   Professor (Pfcode, dept, head, time)   It is assumed that      (i) A professor can work in much more than one

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

Structure Of Distributed Database: A distributed database system haves of a collection of sites, each of which keeps a local databases system. Every site is able to process local

Design a database for an airline.The database must keep track of customers and their reservations,flights and their status, seat assignment on individual flights and, the schedule

What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.

Define database management system? Database management system (DBMS) is a set of interrelated data and a combination of programs to access those data.

What are the two types of serializability? The two types of serializability is a)      Conflict serializability b)      View serializability

A distributed database is defined as "a collection of multiple logically interrelated database which are physically distributed over a computer network" (a) Give any three advan