MindStudy - MindStudy

Question:

Published on: 23 January, 2022

Let R (ABCDE) be a relation schema and consider the following functional dependencies

F = { AB→ E, AD→B, B→ C, C→D}.

Find out the candidate key.

Answer:

Case 1:

as B→C and C→D, so, B→D (transitivity)

as B→D so AB→AD (augmentation)

as AB→E so AB→ABE (reflexivity)

as AB→ABE, AND AB→AD so AB→ABCDE(union)

So the closure of AB is . so, AB is a candidate key.

Case 2:

as AD→B so AD→ABD (reflexivity)

as AB→E so ABD→DE (augmentation)

as AD→B and B→C so AD→C (transitivity)

as AD→ABD, AD→C and AD→DE so AD→ABCDE (union)

So the closure of AB is . so, AD is also a candidate key.

Subjects

Design and Analysis of Algorithm Data Structures & Algorithm Software Engineering Compiler Design Computer Graphics and Multimedia Mobile computing

Trending

What is functional dependency? What is the need for normalization? Explain 2^nd and 3^rd normal form with example. Consider the following relation:

EMP_PROJ { SSn, Pnumber, Hours, Ename, Pname, Plocation}

Assume { SSn, Pnumber} as primary key. The dependencies are

{SSn, Pnumber}→ Hours; SSn →Ename; Pnumber → {Pname, Plocation}.

Normalize the above relation into 2NF.

21 November, 2024

With suitable examples, show how recovery in a database system can be done using Log Files with

Immediate updation
Deferred updation

21 November, 2024

Define a Foreign key. Why is the concept needed? How does it play a role in the join operation?

21 November, 2024

What is the need for normalization? Explain 2nd and 3rd normal form with example.

Consider the following relation:

EMP_PROJ { SSn, Pnumber, Hours, Ename, Pname, Plocation}

Assume { SSn, Pnumber} as primary key.

The dependencies are {SSn, Pnumber}→ Hours; SSn →Ename; Pnumber → {Pname, Plocation}.

Normalize the above relation into 2NF.

23 January, 2022

Explain how to reduce a relationship set of an E-R diagram into relational schema.

23 January, 2022

Perspective Projection