Design and Investigation of a Record System using Hash Collision Resolving Techniques: A Case Study

Jacob John*, Shaik Naseera**
*-**Vellore Institute of Technology, Vellore, Tamil Nadu, India.
Periodicity:October - December'2018


With an increasing demand to structure data for efficient access in large data warehouses, hash tables serve as an efficient way for implementing dictionaries by providing with keys for values of the dictionary. However, such algorithms tend to get computational expensive due to collisions in a hashing (or hash) table. Searching in a hash table under reasonable assumptions, could take an expected time of O (1) (Aspnes, 2015). Although, in practice, hashing performs extremely well, it could take as long as a linked list in a worst case scenario, which is O (n) (Sing & Garg, 2009). Collision, occurs when two keys hash to the same slot or value. The purpose of this article is to research and provide a comparative study on the different hashing techniques and then implement a suitable one for a banking record system scenario.


Hashing, Hash Tables, Collisions, Algorithm, C Language, Record System, Double Hashing

How to Cite this Article?

John, J., Naseera, S. (2018). Design and Investigation of a Record System using Hash Collision Resolving Techniques: A Case Study, i-manager's Journal on Software Engineering, 13(2), 31-35.


Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

If you have access to this article please login to view the article or kindly login to purchase the article
Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.