Data Structure: Unit V (b): Hashing Techniques

Properties of Good Hash Function

Hashing Techniques | Data Structure

The hash function should be simple to compute.

Properties of Good Hash Function

Rules for choosing good hash function

1. The hash function should be simple to compute.

2. Number of collisions should be less while placing the record in the hash table. Ideally no collision should occur. Such a function is called perfect hash function.

3. Hash function should produce such keys which will get distributed uniformly over an array.

4.The hash function should depend on every bit of the key. Thus the hash function that simply extracts the portion of a key is not suitable.

Review Question

1. What are the characteristics of good hashing function?

Data Structure: Unit V (b): Hashing Techniques : Tag: : Hashing Techniques | Data Structure - Properties of Good Hash Function