Can you explain the concept of a hash table collision and how to handle it?
In your answer, describe what causes a collision, why it matters for lookup performance, and the common ways to resolve it. Keep the explanation focused on the concept and the trade-offs between approaches.
| Column | Type | Description |
|---|---|---|
| note_idPK | INT | Unique note identifier |
| concept_name | VARCHAR(100) | Name of the hashing concept |
| detail | TEXT | Short explanation of the concept |