Hashing Technique

Home

 In all search techniques like Linear search, binary search and search trees, the time required to search an element is depends on the total number of element in that data structure. In all these search techniques, as the number of element are increased the time required to search an element also increased linearly.

Hashing is another approach in which time required to search an element doesn't depend on the number of element. Using hashing data structure, an element is searched with constant time complexity. Hashing is an effective way to reduce the number of comparisions to search an element in a data structure.

Hashing is defined as follows...

 Hashing is the process of indexing and retrieving element (data) in a data structure to provide faster way of finding the element using the hash key.

 Here, hash key is a value which provides the index value where the actual data is likely to store in the data structure.

In this data structure, we use a concept called Hash table to store data. All the data values are inserted into the hash table based on the hash key value. Hash key value is used to map the data with index in the hash table. And the hash key is generated for every data using a hash function. That means every entry in the hash table is based on the key value generated using a hash function.

Hash Table is defined as follows...

 Hash table is just an array which maps a key (data) into the data structure with the help of hash function such that insertion, deletion and search operations can be performed with constant time complexity (i.e. O(1)).

 Hash tables are used to perform the operations like insertion, deletion and search very quickly in a data structure. Using hash table concept insertion, deletion and search operations are accoplished in constant time. Generally, every hash table make use of a function, which we'll call the hash function to map the data into the hash table.

A hash function is defined as follows...

 Hash function is a function which takes a piece of data (i.e. key) as input and outputs an integer (i.e. hash value) which maps the data to a particular index in the hash table.

 Basic concept of hashing and hash table is shown in the following figure...

Home

Comments

  1. Unknown24 August 2017 at 01:41

    please write the feedback

    And let me know if you need any things regarding the contents you want

    ReplyDelete

Post a Comment

Popular posts from this blog

Insertion Sort

Image
                                                                     Insertion Sort This is very easy technique to arrange the list of elements either in ascending or descending order. Insertion sort algorithm arranges a list of elements in a particular order. In insertion sort algorithm, every iteration moves an element from unsorted portion to sorted portion until all the elements are sorted in the list. The insertion sort algorithm is performed using following steps... Step 1:  Assume that first element in the list is in sorted portion of the list and remaining all elements are in unsorted portion. Step 2:  Consider first element from the unsorted list and insert that element into the sorted list in order specified. Step 3:  Repeat the above process until all the elements from the unsorted list are moved into the sorted list. Lets see how it works: Insertion sort start's sorting an array by picking 1st element of array. (We begin by assuming that
Read more
                                         Advantage of Web services Home Exposing the existing function on to network: A  Web service  is a unit of managed code that can be remotely invoked using HTTP, that is, it can be activated using HTTP requests. So,  Web Services  allows you to expose the functionality of your existing code over the network. Once it is exposed on the network, other application can use the functionality of your program. Connecting Different Applications ie Interoperability: Web Services allows different applications to talk to each other and share data and services among themselves. Other applications can also use the services of the web services. For example VB or .NET application can talk to java web services and vice versa. So, Web services is used to make the application platform and technology independent. Standardized Protocol: Web Services uses standardized industry standard protocol for the communication. All the four layers (Service Tran
Read more

What is Selection Sort? And how it works?

Image
Click here for more contents Selection Sort Selection Sort algorithm is used to arrange a list of elements in a particular order (Ascending or Descending). In selection sort, the first element in the list is selected and it is compared repeatedly with remaining all the elements in the list. If any element is smaller than the selected element (for Ascending order), then both are swapped. Then we select the element at second position in the list and it is compared with remaining all elements in the list. If any element is smaller than the selected element, then both are swapped. This procedure is repeated till the entire list is sorted. The selection sort algorithm is performed using following steps... Step 1:  Select the first element of the list (i.e., Element at first position in the list). Step 2:  Compare the selected element with all other elements in the list. Step 3:  For every comparision, if any element is smaller than selected element (for Ascending order), then
Read more