/    /  DBMS – Example of Static Hashing

Example of Static Hashing


Example-10: Hash file organization of DEPT file using DName as key, where there are eight departments.

Note: In case of hash functions, the hash function is of two types :

  1. The distribution is uniform: The hash function assigns each bucket the same number of search-key values from the set of all possible search-key values.


  1. The distribution is random : In the average case, each bucket will have nearly the same number of values assigned to it, regardless of the actual distribution of search-key values.


Reference Links

Example of Static Hashing