Dynamic Hashing

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.


Related Terms

Latest Cyber Threats Terms

Related Reading

Margaret Rouse

Margaret Rouse is an award-winning technical writer and teacher known for her ability to explain complex technical subjects to a non-technical, business audience. Over the past twenty years her explanations have appeared on TechTarget websites and she's been cited as an authority in articles by the New York Times, Time Magazine, USA Today, ZDNet, PC Magazine and Discovery Magazine.Margaret's idea of a fun day is helping IT and business professionals learn to speak each other’s highly specialized languages. If you have a suggestion for a new definition or how to improve a technical explanation, please email Margaret or contact her…