Comparative Study of Hashing and Analysis of Collision Resolution Techniques

Most data structures use hash tables. A key method in computer science for effectively storing, accessing, and searching for data is hashing. It involves converting a key into a hash value and using this value to access the corresponding data in a table. Hash table utilization involves trade-offs, just like many other aspects of computer science. The implementation of hash-based containers has two key problems: the collision resolution mechanism and the hash function. However, collisions may occur when two keys are mapped to the same hash value. In this paper, the study is focused on the concept of collision in hashing along with how collision is resolved by comparing the performance of these collision resolution techniques in terms of their time and space complexities. Our findings indicate that each technique has its advantages and disadvantages, and that the best technique to use, relies on the particular application's needs. Therefore, this paper can serve as a guide for developers and researchers to choose the most suitable collision resolution technique for their specific use case.