What is a Hash Algorithm?

Article Details
  • Written By: Jessica Reed
  • Edited By: Heather Bailey
  • Last Modified Date: 14 August 2019
  • Copyright Protected:
    Conjecture Corporation
  • Print this Article
Free Widgets for your Site/Blog
In Japan, over 99 percent of criminal cases that go to trial result in a guilty verdict.  more...

August 22 ,  1902 :  US President Theodore Roosevelt became the first US President to ride in an automobile.  more...

A hash algorithm, also known as a hash function, is a mathematical procedure used in computer programming to turn a large section of data into a smaller representational symbol, known as a hash key. The major use of hash algorithms occurs in large databases of information. Each collection of data is assigned a hash key, which is a short symbol or code that represents it. When a user needs to find that piece of data, he inputs the symbol or code and the computer displays the full data piece.

For hashing, as this process is called, to work it needs a hash function or hash algorithm. This tells the computer how to take the hash key and match it with a set of data it represents. Areas in the computer program known as slots or buckets store information and each key links to a specific slot or bucket.

To understand a hash algorithm fully, it's best to imagine a computer program working somewhat like a dictionary. Each letter of the alphabet represents a hash key. The pages that contain all the words starting with a certain letter count as a slot or bucket. If a person was searching for a list of words that begin with the letter A, he could type the letter A, which represents a key, into the computer and the hash algorithm would search for the slot that matches that specific key.


It would then retrieve all the pieces of data in that slot. In this case it would return all the words that started with the letter A. This example shows a simplified version of how a hash algorithm works. It may also link a hash key to one specific piece of data and only that piece of data would appear instead of multiple pieces.

The entire process is contained within a hash table or hash map. This table records data and the matching keys that correspond to it. It then uses a hash algorithm to connect a key to a piece of data when the user requests it. A researcher who is trying to compare similar recordings from his experiments might create a hash algorithm which assigns a key to any data that is similar. It would then show him all the similar pieces of data at once for him to compare.


You might also Like


Discuss this Article

Post your comments

Post Anonymously


forgot password?