MindStudy - MindStudy

Question:

Published on: 23 February, 2025

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 ADrarr;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

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

Trending

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.

23 February, 2025

What is Weak entity set? Explain with suitable example.

23 February, 2025

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

Immediate updation
Deferred updation

23 February, 2025

Consider the following tables:

DEPT (DCODE, DNAME)

EMP (ECODE, ENAME, BASIC, DCODE, DT_JN)

Write down the SQL statements for the following:

For each department, show DNAME and total basic of the employee in the department.
Find out the names of the department where no person is working.
Find out the names of the employees who are working in the department named as ‘ABC’.
Find out the maximum basic among the employees who have joined after year 2000.

23 February, 2025

Consider the relation R={A,B,C,D,E,F,G,H,I,J} and the set of functional dependencies: F={AB → C, A → DE, B → F, F → GH, D → IJ}. Decompose R into 3NF.

23 February, 2025