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
Attributes attached to an entity can be of various types. Simple The attribute that cannot be further separated into smaller parts and shows the basic meaning is known as a

What are the disadvantages of file processing system? The drawbacks of file processing systems are a) Data redundancy and inconsistency b) Complexity in accessing data

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

If one requires to access data using Logical Database , the use of events is unavoidable. Yes, if someone wants to access data using Logical database then the use of events

What is a Database? To know what database is, we have to start from data, which is the basic building block of any DBMS. Data: Facts, figures, statistics etc. having no pa

Consider the relation schemas as follows. works (person name, company name, salary); lives (person name, street, city); located in(company name, city); managers (person name

What is known as clustering file organization? In the clustering file organization, records of several dissimilar relations are stored in the similar file.

What is DML compiler? DML Compiler: Translates DML statements in a query language within low level instructions understandable through the query evaluation engine. Attempts to

Describe the term- State Diagram State Diagram: An object could receive a sequence of the input instructions. The state of the object can differ depending upon sequence of in