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
State the Object Design for Processing  The object design phase comes after analysis and system design phase. The object design phase includes implementation details like as i

Having clause This clause is used for producing conditions on grouped information. Example: Find maximum salary and department number of those departments where maxim

Describe association design of an object by giving one suitable example of it. The Design of Associations Associations are "glue" of advanced object oriented analysis and

The C_Artist  application will be developed using the C language (C99 standards) and will be able to compile without warnings and link and run in the Swinburne computer laboratorie

what is bogus empowerment. And what is genuine empowerment

Control as State within Program 1.  The term control exactly means to check effect of input within a program. For illustration, in Figure, after the ATM card is inserted (a

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

Economics: It is now usually accepted that it costs less to make a system of smaller computers with the equivalent power of a one large computer. It is more cost-effective to get s

State as Location within a Program In this traditional approach, location of control inside a program totally defines the program state. Any finite state machine may be implem