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

Define the concept of design documentation, Design Documentation The ...

Design Documentation The Design Document shall be an extension of Requirements Analysis Design. "The Design Document will comprise a revised and much more detailed descrip

Constraints violation during insertion, If the insertion violates one or mo...

If the insertion violates one or more constraints, then two alternatives are available: Default option: - Insertion can be discarded and the reason of refusal can also be ex

Lack of redundancy, Lack of Redundancy We have talked about the problems o...

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

Distinguish among a datareader class and a dataset class, Question (a) ...

Question (a) Concurrent access to data from a database is a normal part of application program usage. Describe three approaches to concurrency control (b) Distinguish among

Having clause with sub queries, Having Clause with sub queries: First we h...

Having Clause with sub queries: First we have to recollect the GROUP BYclause. The following query searches the minimum salary in every department. SELECT DEPTNO, MIN (SAL)

Define the query optimisation, Define the Query optimisation The query ...

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

What are temporary tables, What are temporary tables? Temporary tables...

What are temporary tables? Temporary tables exist solely for a particular session or whose data persists for the duration of the transaction.

Keys - relational database integrity, Candidate Key: In a relation R, a ca...

Candidate Key: In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1) Uniqueness: N

How can redundant associations be done, How can Redundant Associations be d...

How can Redundant Associations be done It can be done by asking questions: i) Is there a specific arrangement of network which would optimize critical aspects of completed

Can you scan double-sided documents and remove blank pages, Can you scan do...

Can you scan double-sided documents - and remove blank pages? Our software and imaging systems supports duplex scanning, at the same time scanning both sides of a page. Program

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages