Hashing is a data structure that is used to store a large amount of data, which can be accessed in
O(1) time by operations such as search, insert and delete. Various Applications of Hashing are:
- Indexing in database
- Symbol Tables in Compiler/Interpreter
- Dictionaries, caches, etc.
Concept of Hashing, Hash Table and Hash Function
Hashing is an important Data Structure which is designed to use a special function called the Hash function which is used to map a given value with a particular key for faster access of elements. The efficiency of mapping depends of the efficiency of the hash function used.
h(large_value) = large_value % m
h() is the required hash function and ‘m’ is the size of the hash table. For large values, hash functions produce value in a given range.
How Hash Function Works?
- It should always map large keys to small keys.
- It should always generate values between 0 to m-1 where m is the size of the hash table.
- It should uniformly distribute large keys into hash table slots.
- Open Addressing (Linear Probing, Quadratic Probing, Double Hashing)
If we know the keys beforehand, then we have can have perfect hashing. In perfect hashing, we do not have any collisions. However, If we do not know the keys, then we can use the following methods to avoid collisions:
While hashing, the hashing function may lead to a collision that is two or more keys are mapped to the same value. Chain hashing avoids collision. The idea is to make each cell of hash table point to a linked list of records that have same hash function value.
Note: In Linear Probing, whenever a collision occurs, we probe to the next empty slot. While in Quadratic Probing, whenever a collision occurs, we probe for
i^2th slot in the ith iteration and we keep probing until an empty slot in the hashtable is found.
Performance of Hashing
The performance of hashing is evaluated on the basis that each key is equally likely to be hashed for any slot of the hash table.
m = Length of Hash Table n = Total keys to be inserted in the hash table Load factor lf = n/m Expected time to search = O(1 +lf ) Expected time to insert/delete = O(1 + lf) The time complexity of search insert and delete is O(1) if lf is O(1)
Python Implementation of Hashing
0 --> Allahabad --> Mathura 1 --> Punjab --> Noida 2 3 4 5 --> Mumbai 6 7 8 9 --> Delhi
- Hashing in Distributed Systems
- Mid-Square hashing
- String hashing using Polynomial rolling hash function
- Python program to check if the list contains three consecutive common numbers in Python
- Python List Comprehension and Slicing
- List Methods in Python | Set 1 (in, not in, len(), min(), max()...)
- List Methods in Python | Set 2 (del, remove(), sort(), insert(), pop(), extend()...)
- List methods in Python
- Python | Set 3 (Strings, Lists, Tuples, Iterations)
- Output of Python program | Set 6 (Lists)
- Output of python program | Set 11(Lists)
- Python | Converting all strings in list to integers
- Stack and Queues in Python
- 10 Essential Python Tips And Tricks For Programmers
- Python | range() method
- Python Slicing | Reverse an array in groups of given size
- Move all zeroes to end of array using List Comprehension in Python
- K’th Non-repeating Character in Python using List Comprehension and OrderedDict
- Python | Check if all the values in a list that are greater than a given value
- Print anagrams together in Python using List and Dictionary
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.