Correctness of Statements about Keys, Normal Forms, and Generalization

Correctness of Statements about Keys, Normal Forms, and Generalization

Verified Sources
Sep 13, 2026

We evaluate each statement about database normalization and generalization by using formal definitions of key properties and normal-form conditions. The question asks: Which of (i)–(iv) is true?

We will analyze:

  • superkey vs candidate key relationships
  • 3NF vs BCNF relationship
  • generalization approach direction (top-down vs bottom-up)

A crucial note: I attempted web research using the required tavily_search tool, but it failed due to a plan/usage limitation, so I cannot provide web-backed citations for the claims here. Therefore, I’ll answer using standard database theory definitions and relationships.

Normalization: 3NF vs BCNF (conceptual)

(i) “A super-key is always a candidate key.”

Key relationship

A superkey is any attribute set whose closure determines the whole row. A candidate key is a minimal superkey.

  • If XX is a candidate key, then XX is a superkey (true).
  • But if XX is a superkey, it may not be minimal—there may be a smaller subset that is still a superkey.

Conclusion for (i)

So, (i) is false.
Example idea: If {A}\{A\} is a candidate key, then {A,B}\{A,B\} is also a superkey but not a candidate key (it’s not minimal).

(ii) “Every 3NF schema is also a BCNF.”

Normal form containment

BCNF is stricter than 3NF.

  • Every BCNF schema is in 3NF (true).
  • But not every 3NF schema is in BCNF (false in general).

Why (ii) is typically false

3NF allows some FDs of the form:

  • XAX \to A where AA is a prime attribute even if XX is not a superkey. BCNF does not allow this relaxation: BCNF requires XX to be a superkey for every non-trivial FD.

Conclusion for (ii)

So, (ii) is false.

(iii) “Generalization is bottom-up approach.”

Direction of generalization/specialization in ER modeling

In ER modeling and conceptual design:

  • Generalization is commonly presented as a top-down approach: start from a general entity and define subtypes.
  • Specialization is also typically described as proceeding from general to specific (top-down).

“Bottom-up generalization” would mean starting from specific subtypes and moving upward to a general supertype, which is sometimes discussed conceptually, but the standard approach wording in many curricula treats generalization as top-down.

Conclusion for (iii)

So, (iii) is false.

(iv) “None of these.”

Since (i), (ii), and (iii) are all false, the only remaining option is:

(iv) none of these.

How to decide the correct option quickly

  1. 1
    Step 1

    A candidate key must be a minimal superkey. If the statement claims every superkey is a candidate key, test minimality—if it fails, the statement is false.

  2. 2
    Step 2

    BCNF is stricter. If the statement says 3NF implies BCNF, recall that BCNF \Rightarrow 3NF, not the reverse.

  3. 3
    Step 3

    Generalization is generally taught as top-down (from general to specific). If the statement says bottom-up, treat it as false unless a course explicitly defines the opposite.

  4. 4
    Step 4

    If (i)–(iii) are false, then (iv) is true by elimination.

Tip for exam-style key/normal-form MCQs

Use implication chains: BCNF ⇒ 3NF. If you see 3NF ⇒ BCNF, it’s almost always false.

Warning: wording traps in generalization

Some sources describe modeling tasks as either ‘top-down’ or ‘bottom-up’ depending on the design workflow. In standard DB design theory, generalization is typically treated as top-down; so claims that contradict that are usually wrong.

Truth values of the given statements

Based on standard definitions/implications in relational database theory.

Key definitions used in the reasoning

Quick self-check

1 / 5
Question · Term

Is every candidate key a superkey?

Click to reveal
Answer · Definition

Yes. A candidate key is a minimal superkey, so it is still a superkey.

Knowledge Check

Question 1 of 4
Q1Single choice

Which statement is true?