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 Reading

Margaret Rouse

Technology Specialist

Margaret is an award-winning writer and educator known for her ability to explain complex technical topics to a non-technical business audience. Over the past twenty years, her IT definitions have been published by Que in an encyclopedia of technology terms and cited in articles in the New York Times, Time Magazine, USA Today, ZDNet, PC Magazine, and Discovery Magazine. She joined Techopedia in 2011. Margaret’s idea of a fun day is to help IT and business professionals to learn to speak each other’s highly specialized languages.

All Articles by Margaret Rouse