Module 3: Hashing
  Lecture 9: Static and Dynamic Hashing
 

                                            

 

 

Static hashing
  • Single hash function on key
  • Desirable properties of a hash function
 
  • Uniform: Total domain of keys is distributed uniformly over the range
 
  • Random: Hash values should be distributed uniformly irrespective of distribution of keys
  • search
  • Example of hash functions:
  • Collision resolution
  • Chaining
 
  • Load factor
 
  • Primary pages and overflow pages (or buckets)
 
  • Search time more for overflow buckets