Title: PERFORMANCE EVALUATION OF THE ENHANCED HASH ALGORITHM USING VECTOR ANDHASH FUNCTION
Abstract: Hashing is well-known due to its usefulness and rapid access to data in many Information Technology areas such as in networking and NLP. It i s also
very useful in the fields of Information Retrieval, as well as, Text Mining. Items are distributed in the hash table by the hash function. However,
collision occurs when more than one items have the same value hashed. The collision resolution will resolve such problem. The algorithm was
enhanced by modifying the lookup procedure using another hash function and Vector data structure, to improve the time consumed during lookup
while resolving the collision. The objectives are to determine the success rate of the modified hashing algorithm in resolving hash collisions; to
evaluate the performance and compare the modified hashing Algorithm with the original linked list chained algorithm using the same string
datasets in terms of Lookup time, Work Efficiency; and the count of Memory Accesses in the search procedure, as well as its Time Complexity.
Results showed that the enhanced hashing algorithm has successfully resolved collision on any table and data sizes. The Big O notation analysis
showed that the time complexity of the search operation is O(1). It also guarantees that every search operation can achieve 1 or 2 memory accesses
on different data and table sizes.
Publication Year: 2020
Publication Date: 2020-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot