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

What are the situations while dbms should not be used, What are the situati...

What are the situations while DBMS should not be used? DBMS should not be used in situations like: (i) No need of security. (ii) Not difficulty to access the data (iii) N

ERD, A student entity type has the following attributes,name..

A student entity type has the following attributes,name..

Architecture, With the help of a suitable diagram gives module wise explana...

With the help of a suitable diagram gives module wise explanation of system architecture of DBMS.on..

Why like predicate used for, Why Like predicate used for? LIKE predicat...

Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.

State about the advance object design, ADVANCE OBJECT DESIGN Introduct...

ADVANCE OBJECT DESIGN Introduction Analysis is the initial step of the OMT methodology. It is apprehensive with devising a precise, concise, correct and understandable mo

Describes the several relationship constraints, Describes the several relat...

Describes the several relationship constraints through giving suitable example? Constraints on relationships: There are two kinds of constraints on relationships. 1) Mapping

Back up files, what is the importance of back up files

what is the importance of back up files

Determine the object-oriented design process, An object-oriented design pro...

An object-oriented design process  1. Define the context and modes 2. Designs the system architecture 3. Identifies the principal system objects 4. Identifies concurrency in

Differentiate between key and superkey, Differentiate between Key and super...

Differentiate between Key and superkey? Key and superkey - A key a single attribute or a combination of two or more attributes of an entity set in which is used to identify o

State the terms designing the database and normalization, State the terms D...

State the terms Designing the database and Normalization Designing the database: Out of the ERD we have formed, it is very easy to verify the tables, the attributes which the

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