857 views
1 1 vote

Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity..

plz clarify this........

1 Answer

1 1 vote
clearification of above statement is in two ways

(a) weak entity is totally participated in strong entity i.e. each element of weak entity is must have some element in strong entity

but weak entity have not its own primary key it is identified by primary key of strong entity

(b) suppose if we duplicate the weak entity set then we have to duplicate the primary key as we know that primary key must contain unique value which is not possible so there will be contradiction here
Position:
Show:

Related questions

1 1 vote
1 1 answer
549
549 views
4 4 votes
1 answers 1 answer
4.5k
4.5k views
radha gogia asked Jul 26, 2015
4,487 views
1:1 1:M M:1 M:N
0 0 votes
1 1 answer
838
838 views
radha gogia asked Jul 5, 2015
838 views
Cross Edge(a,b) is defined as an edge between two non-ancestor nodes in DFS , so my query is that how is this stmt true :arrival[b] <departure[b] <arrival[a] <departure[a...
0 0 votes
0 0 answers
405
405 views
codingo1234 asked Apr 8, 2019
405 views
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?