An entity type should have a key attribute which uniquely identifies each entity in the entity set, but there exists some entity type for which key attribute can’t be defined. These are called Weak Entity type.
The entity sets which do not have sufficient attributes to form a primary key are known as weak entity sets and the entity sets which have a primary key are known as strong entity sets.
As the weak entities do not have any primary key, they cannot be identified on their own, so they depend on some other entity (known as owner entity). The weak entities have total participation constraint (existence dependency) in its identifying relationship with owner identity. Weak entity types have partial keys. Partial Keys are set of attributes with the help of which the tuples of the weak entities can be distinguished and identified.
Note – Weak entity always has total participation but Strong entity may not have total participation.
Weak entity is depend on strong entity to ensure the existence of weak entity. Like strong entity, weak entity does not have any primary key, It has partial discriminator key. Weak entity is represented by double rectangle. The relation between one strong and one weak entity is represented by double diamond.
Weak entities are represented with double rectangular box in the ER Diagram and the identifying relationships are represented with double diamond. Partial Key attributes are represented with dotted lines.
In the below ER Diagram, ‘Payment’ is the weak entity. ‘Loan Payment’ is the identifying relationship and ‘Payment Number’ is the partial key. Primary Key of the Loan along with the partial key would be used to identify the records.
The existence of rooms is entirely dependent on the existence of a hotel. So room can be seen as the weak entity of the hotel.
The bank account of a particular bank has no existence if the bank doesn’t exist anymore.
A company may store the information of dependants (Parents, Children, Spouse) of an Employee. But the dependents don’t have existence without the employee. So Dependent will be weak entity type and Employee will be Identifying Entity type for Dependant.
Strong entity | Weak entity Order | Order Item Employee | Dependent Class | Section Host | Logins
Note – Strong-Weak entity set always has parent-child relationship.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Difference between Strong and Weak Entity
- Difference between Entity and Object
- Difference between Entity constraints, Referential constraints and Semantic constraints
- Minimization of ER Diagrams
- Recursive Relationships in ER diagrams
- Discrete Mathematics | Hasse Diagrams
- Mathematics | Set Operations (Set theory)
- C Language | Set 1
- Operating Systems | Set 1
- Operating Systems | Set 2
- Automata Theory | Set 1
- Compiler Theory | Set 1
- Operating Systems | Set 3
- Database Management Systems | Set 1
- Data Structures and Algorithms | Set 1
- Data Structures and Algorithms | Set 3
- C Language | Set 2
- Data Structures and Algorithms | Set 2
- C Language | Set 3
- Data Structures and Algorithms | Set 4
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.