Dynamic hashing and its improvement

Extensible hashing and linear hashing were discussed,and an improved algorithm for the hashing suffix length inequality was stated,which avoided unnecessary overflow bucket.The number of hash buckets grow linearly,which avoid splitting buckets and updating bucket address table continually,caused by unusual distribution of search key.The experiments of the simulation method showed that the improved algorithm was significantly better than extensible hashing and linear hashing.