How to Search a Key?
- Calculate the hash address of key.
- Calculate the number of bits used in the dictionary and denote these bits as i.
- Take the least significant i bits of hash address. This provides index of dictionary.
- This index is used to navigate to the dictionary and check for bucket address in which record may be present.
Dynamic Hashing in DBMS
In this article, we will learn about dynamic hashing in DBMS. Hashing in DBMS is used for searching the needed data on the disc. As static hashing is not efficient for large databases, dynamic hashing provides a way to work efficiently with databases that can be scaled.