Amazon Interview Question
AnalystsDynamic Hashing is neither Open Addressing nor Distributed Hashing. It is kind of Extendible Hashing. Hash function will return a 120 bit value. You will use least number of bits for maping. Like if you have two entries, One bit is Ok. If four entries, you need to use two bits from 120 bits, Similarly for 8 entries 3 bits will be used, blah , blah. It grows dynamically. When we have huge records in database, we use it.
A quick answer to the definition:
- Kunzi July 27, 2009A hash table that grows dynamically to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when items are deleted.