Dynamic hashing techniques allow the hash function to be modified dynamically to accommodate the growth or shrinkage of the database. Obviously, dynamic hashing overcomes static hashing problems where the number of buckets is fixed and does not change. A well-known technique of dynamic hashing is extendable hashing which copes with changes in database size by splitting and coalescing buckets as the database grows and shrinks. As a result, space efficiency is retained. Moreover, since the reorganization is performed on only one bucket at a time, the resulting performance overhead is acceptably low.
Your goal in this project is to implement an extendable hashing simulator with three basic operations: lookup, insert and delete. Your simulator should be linked with a main program in-order to test its functionality. Note: you should choose the appropriate data structure for the software.
Hi! I'm interesting your project very well. I am mastering Java and I'm a good Mathematician. And also I have many experience and good skill about hash algorithm. Let's go ahead with me