Pages

Thursday 11 November 2021

How to find the number of candidate keys in the given relation schema

Example 1:

R (ABCDEFGH)

CH->G

A->BC

B->CFH

E->A

F->EG

Candidate Keys are : AD,BD,DE,DF

Example 2:

R (ABCDEF)

AB->C

C->D

B->AE

Candidate Keys are : BF

Example 3:

R (ABCD)

AB->CD

D->A

Candidate Keys are : AB,BD

Example 4:

R (ABCD)

A->B

B->C

C->A

Candidate Keys are : AD,BD,CD

Example 5:

R (ABCD)

ABC->D

AB->CD

A->BCD

Candidate Keys are : AB,AC,AD

No comments:

Post a Comment

Conflict Serializability

Find out conflict serializability for the given transactions T1 T2 T3 R(X)     ...