Difference Between Dynamic and Static Hashing
In data structure, hashing is a technique of mapping large number of data items to smaller tables using a special function called the Hash function for faster access. Sometimes the data structure is so huge that it gets almost next to impossible to search all the index values through all the levels in order to access to final data block. This is where hashing comes right in. What it does is it calculates the location of a data record on the disk directly without using the index structure.