Diffrence between static and dynamic hashing

STATIC  HASHING :                                                                                      DYNAMIC  HASHING:     

• Numbers of buckets are fixed.                                                         Numbers of Buckets are not fixed.
• As the file grows, performance decreases.                                 Performance donot degrade as the file grows.
• Space overhead is more.                                                                     Minimum space lies overhead.
• Here we donot use Bucket  Address table.                                   Bucket address table is used.
• Open hashing and Closed hashing are  forms of it.                   Extendable hashing and Linear hashing are  forms of it.
• No complex implementation.                                                            Implementation is comlex.
• It is a less attractive technique.                                                         It is a highly attractive technique.
• Here system directly accesses the Bucket.                                    Here the Bucket address table is accessed before accessing the Bucket.
• Chaining used is overflow chaining.                                                 Overflow chaining is not used

Note:

BUCKET: It is similar to Disk Block. Several items are stored in it.

BUCKET OVERFLOW: This is a condition which arises due to lack of enough space in bucket at the time of insertion.

OVERFLOW CHAINING: It is used in static hashing.It is a method used to compensate the problem of bucket overflow.

BUCKET ADDRESS TABLE: It is the table that keeps the address of  buckets.

 http://www.careersoft-technology.com/diffrence-between-static-and-dynamic-hashing/