Note
- Trying to find the next empty bucket for the conflicted key-value pair by executing the Hash Function multiple times
Mechanism
Search key-value pair with key
- Obtain the Array index by passing the key to the Hash Function
- If the desired key-value pair isn’t inside the bucket, perform the Hash Function again until we find the correct key-value pair
- If empty bucket is countered, then the desired key-value isn’t stored in the Hash Map
Add key-value pair
- Obtain the Array index by passing the key to the Hash Function
- If the bucket already has a key-value pair, then keep performing Hash Function until an empty bucket is found, then insert the key-value pair
Pros
Not easy to have key-value pair clustering
Cons
Hash Function performed means more computation is required