Prove that any relation schema with two attributes is in BCNF.

What will be an ideal response?


Consider a relation schema R={A, B} with two attributes. The only possible (non-trivial)
FDs are {A} ->{B} and {B} ->{A}. There are four possible cases:
(i) No FD holds in R. In this case, the key is {A, B} and the relation satisfies BCNF.
(ii) Only {A} ->{B} holds. In this case, the key is {A} and the relation satisfies BCNF.
(iii) Only {B} ->{A} holds. In this case, the key is {B} and the relation satisfies BCNF.
(iv) Both {A} ->{B} and {B} ->{A} hold. In this case, there are two keys {A} and {B} and
the relation satisfies BCNF.
Hence, any relation with two attributes is in BCNF.

Computer Science & Information Technology

You might also like to view...

12. Approximately how many people wrote Linux? Why is this project unique?

What will be an ideal response?

Computer Science & Information Technology

________ queries are used when migrating data to a new database or to capture and store data at a specific point in time

Fill in the blank(s) with correct word

Computer Science & Information Technology

____ is a very common file system used by computers and is supported by many different operating systems.

A. File Allocation Table B. File Arrangement Table C. File Allocation Tree D. File Attribute Tree

Computer Science & Information Technology

Index values start with 1 so that the initial item in an array has an index value of 1, the second item has an index value of 2, and so on.?

Answer the following statement true (T) or false (F)

Computer Science & Information Technology