|
Twitter
|
Facebook
|
Google+
|
VKontakte
|
LinkedIn
|
 
 
International Journal of Innovation and Scientific Research
ISSN: 2351-8014
 
 
Monday 24 September 2018

About IJISR

News

Submission

Downloads

Archives

Custom Search

Contact

Connect with IJISR

   
 
 
 

Hash Table Collision Resolution Using a Multi-dimensional Array


Volume 9, Issue 2, September 2014, Pages 258–267

 Hash Table Collision Resolution Using a Multi-dimensional Array

Peter Nimbe, Michael Opoku, Samuel Ofori Frimpong, Audrey Asante, and Dominic-Mary Kornu

Original language: English

Received 1 August 2014

Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract


This paper presents a new and innovative technique for handling collisions in hash tables based on a multi-dimensional array. The proposed strategy followed the standard ways of evaluating and implementing algorithms to resolve collisions in hash tables. This technique is an effective way of handling the problem of collisions in hash table slots or cells but at a slight expense of space. It was discussed that an optimal representation of this scheme is to minimize or completely remove the empty spaces created within the array.

Author Keywords: Open Addressing, Separate Chaining, Linear Probing, Quadratic Probing, Double hashing, Hash Function.


How to Cite this Article


Peter Nimbe, Michael Opoku, Samuel Ofori Frimpong, Audrey Asante, and Dominic-Mary Kornu, “Hash Table Collision Resolution Using a Multi-dimensional Array,” International Journal of Innovation and Scientific Research, vol. 9, no. 2, pp. 258–267, September 2014.