Which of the following statements is FALSE about weak entity set?
2015
Which of the following statements is FALSE about weak entity set?
- A.
Weak entities can be deleted automatically when their strong entity is deleted.
- B.
Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity.
- C.
A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included
- D.
Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
Attempted by 350 students.
Show answer & explanation
Correct answer: D
A weak entity set is existence-dependent on a strong entity set, meaning it cannot exist without the associated strong entity. Weak entities are identified by combining a partial key with the primary key of the related strong entity. Thus, they are partitioned according to this relationship. Any statement claiming weak entities do not depend on strong entities or are not partitioned by this relationship is false.
A video solution is available for this question — log in and enroll to watch it.