Prove that a relation which is 4nf must be bcnf, Database Management System

Assignment Help:

Prove that a relation which is 4NF must be BCNF.  

Ans Let R be in 4NF.  Suppose it is not in BCNF.  Hence, there exists an FD X→Y in R such that x is not a super key. Although by the rule M1 X→Y|=x→→Y. Once again x here is not a super key.  This contradicts the fact that R is in 4NF.  Hence, our assumption is false.  Each R in 4NF should be in BCNF.


Related Discussions:- Prove that a relation which is 4nf must be bcnf

What is d command work in the respect of qbe, What is D command work in the...

What is D command work in the respect of QBE? D: It is the command inside QBE to delete tuple(s) from the relation.

Describe participation constraints, Describe Participation Constraints? ...

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

The extract statement do in extract datasets, What does the extract stateme...

What does the extract statement do in extract datasets? The data is written to virtual memory by extract commands.

What are the requirements of algorithm designer, What are the Requirements ...

What are the Requirements of algorithm designer Algorithm designer should: i) Select proper algorithm so as to minimize implementation cost ii) Find most appropriate d

What is candidate key, What is candidate key? Candidate Key - A candi...

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

Student, explain exhausitively the problems associated with er diagrams wit...

explain exhausitively the problems associated with er diagrams with ellustrations

File organisation and its types, File Organisation And Its Types  Just ...

File Organisation And Its Types  Just as arrays, trees, lists and other data structures are used to execute data Organisation in main memory, a number of planning's are used to

Payment processors, We have a buildup of payments that need to be processed...

We have a buildup of payments that need to be processed. You will need:- To prepare customer account on our site Process payment (you must have working Paypal account to d

Define a relation schema, A Relation Schema represented by R(A1, A2, .....

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

Binary relationship, explain in details about one to one binary relationshi...

explain in details about one to one binary relationship

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