Question Details

In the context of relational database normalization, which of the following statements is/are true?

Options

A

It is always possible to obtain a dependency-preserving 3NF decomposition of a relation

B

It is always possible to obtain a dependency-preserving 1NF decomposition of a relation

C

It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

D

It is not always possible to obtain a dependency-preserving 2NF decomposition of a relation

Show Answer
Correct Answer
A It is always possible to obtain a dependency-preserving 3NF decomposition of a relation
B It is always possible to obtain a dependency-preserving 1NF decomposition of a relation
C It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

Solution :

The correct statements are:
1. It is always possible to obtain a dependency-preserving 3NF decomposition of a relation
2. It is always possible to obtain a dependency-preserving 1NF decomposition of a relation
3. It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

Let us analyze each statement step-by-step:

1. Dependency Preservation in 3NF (Third Normal Form):
For any relational schema R and a set of functional dependencies F, there is a standard algorithm (often called the 3NF Synthesis Algorithm) that guarantees a decomposition into schemas R1, R2, ..., Rk such that:
• Each Ri is in 3NF.
• The decomposition is lossless-join.
• The decomposition preserves all functional dependencies in F (i.e., the union of the projections of F onto each Ri is equivalent to F).
Thus, a dependency-preserving 3NF decomposition is always possible.

2. Dependency Preservation in 1NF (First Normal Form):
First Normal Form (1NF) only requires that the domain of each attribute contains only atomic values and that the value of each attribute in a tuple is a single value from its domain. It does not impose any restrictions on functional dependencies. Since a relation is already in 1NF or can trivially be decomposed/flattened into 1NF without losing any attributes or functional dependencies, obtaining a dependency-preserving 1NF decomposition is always possible.

3. Dependency Preservation in BCNF (Boyce-Codd Normal Form):
Boyce-Codd Normal Form is stricter than 3NF. It requires that for every non-trivial functional dependency X→Y, the determinant X must be a superkey. Due to this strict requirement, we cannot always guarantee dependency preservation.
For example, consider the relation R(A, B, C) with functional dependencies:
AB→C
C→A
Here, the candidate keys are AB and BC. The dependency C→A violates BCNF because C is not a superkey. If we decompose the relation to satisfy BCNF, we get R1(A, C) and R2(B, C). However, in this decomposition, the functional dependency AB→C cannot be checked within any single decomposed relation without performing a join. Hence, the dependency is lost. This proves that it is not always possible to obtain a dependency-preserving BCNF decomposition.

Transparent Access on Mindyard

Built for Learners & Educators Alike

Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.

FREE FOR STUDENTS

Practice & Learn Free for Students

Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.

  • Unlimited mock tests & question bank practice
  • Full access to curated study library & formula notes
  • 100% free for students • No credit card required
2 MONTHS FREE TRIAL

Educators & Coaching Institutes

Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.

  • AI question uploader & rapid test generator
  • Anti-cheating tab proctoring & performance reports
  • Full Pro access free for 60 days • No upfront commitment
Discover more resources

You may also like

Mock Tests

View All
  • GATE
  • beginner
  • 3 hours
  • civil engineering

Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.

  • GATE
  • beginner
  • 3 hours
  • electronics and communication engineering

Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.

Ask AI Tutor
5 left
Q1 View Question & Options
AI Tutor is solving this question...
Reading question context & options...
Ask your own doubt or choose a quick prompt: