Volume 13, Issue 1, January 2015, Pages 89–97
Peter Nimbe1, Michael Opoku2, and Samuel Ofori Frimpong3
1 Department of Computer Science, K.N.U.S.T, Kumasi, Ghana
2 Department of Computer Science, K.N.U.S.T, Kumasi, Ghana
3 Department of Computer Science, C.U.C.G, Sunyani-Fiapre, Ghana
Original language: English
Copyright © 2015 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.
This paper presents the systematic way of hashing string values using NFO and NOF collision resolution strategies. NFO and NOF are techniques used for hashing numeric keys. The same principles and techniques for hashing numeric keys are deployed in the hashing of string values but with slight modifications in the hashing process and implementations. These variants followed the standard ways of evaluating and implementing algorithms to resolve collisions in hash tables. They are very effective in resolving the problem of collisions of string keys or values in the same slot of a hash table.
Author Keywords: NFO Strategy, NOF Strategy, Hash Function, Hash Tables, Collision Resolution, ASCII Value, Algorithm.
Peter Nimbe1, Michael Opoku2, and Samuel Ofori Frimpong3
1 Department of Computer Science, K.N.U.S.T, Kumasi, Ghana
2 Department of Computer Science, K.N.U.S.T, Kumasi, Ghana
3 Department of Computer Science, C.U.C.G, Sunyani-Fiapre, Ghana
Original language: English
Copyright © 2015 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 the systematic way of hashing string values using NFO and NOF collision resolution strategies. NFO and NOF are techniques used for hashing numeric keys. The same principles and techniques for hashing numeric keys are deployed in the hashing of string values but with slight modifications in the hashing process and implementations. These variants followed the standard ways of evaluating and implementing algorithms to resolve collisions in hash tables. They are very effective in resolving the problem of collisions of string keys or values in the same slot of a hash table.
Author Keywords: NFO Strategy, NOF Strategy, Hash Function, Hash Tables, Collision Resolution, ASCII Value, Algorithm.
How to Cite this Article
Peter Nimbe, Michael Opoku, and Samuel Ofori Frimpong, “Hashing String Keys Using NFO and NOF Collision Resolution Strategies,” International Journal of Innovation and Scientific Research, vol. 13, no. 1, pp. 89–97, January 2015.
