Descriptive Review on Collision Resolution Technique in Data Structure

Abstract

A situation when the resultant hashes for two or more data elements in the data set U, maps to the same location in the has table, is called a hash collision. In such a situation two or more data elements would qualify to be stored/mapped to the same location in the hash table. to resolve the problem of collision we use collision resolution technique. There are some useful technique with the help of them we can reduce collision from hash table