Dynamic Hashing

Last Updated: March 25, 2020

Definition - What does Dynamic Hashing mean?

Dynamic hashing is a database process in which the contents of data "buckets" (or other container systems) can grow or shrink in order to accommodate a hashing technique.

Techopedia explains Dynamic Hashing

The general hash technique is a technique where database contents are translated into fixed bit strings, and then retrieved on demand. With static hashing, the hash function will always return the same static bucket.

With dynamic hashing, the bucket contents can expand based on specific techniques such as add-ons.

The dynamic build of a hashing system allows for scaling with the same key based security and efficiency. Database hashing, as a modern version of data control, helps to prevent various kinds of data breaches and other unwanted outcomes.

Share this: