A tree based approach to improve traditional collision avoidance mechanisms of hashing

Dhar, Siddharth; Pandey, Kaustubh; Premalatha, M.; Suganya, G.

doi:10.1109/icici.2017.8365368

Cited by 5 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a high load factor environment this method provide a non-constant time complexity of O(n) for inserting and retrieving a key from the hash table and tends to cause problem of tracking linked list [5]. However, another method invented by Dhar et al [16] provide better performance from O(1+n) to O(logn). The technique uses a binary search tree to chain a collide key rather than using a list or linked list which reduces the time for searching a key.…”

Section: ) Openmentioning

confidence: 99%

Collision Resolution Techniques in Hash Table: A Review

Yusuf¹,

Sudi²,

Boukar³

et al. 2021

IJACSA

View full text Add to dashboard Cite

One of the major challenges of hashing is achieving constant access time O(1) with an efficient memory space at a high load factor environment when various keys generate the same hash value or address. This problem causes a collision in the hash table, to resolve the collision and achieve constant access time O(1) researchers have proposed several methods of handling collision most of which introduce a non-constant access time complexity at a worst-case scenario. In this study, the worst case of several proposed hashing collision resolution techniques are analyzed based on their time complexity at a high load factor environment, it was found that almost all the existing techniques have a non-constant access time complexity. However, they all require an additional computation for rehashing keys in a hash table some of which is as a result of deadlock while iterating to insert a key. It was also found out that there are wasted slots in a hah table in all the reviewed techniques. Therefore, this work, provides an in-depth understanding of collision resolution techniques which can serve as an avenue for further research work in the field.

show abstract

Section: ) Openmentioning

confidence: 99%

Collision Resolution Techniques in Hash Table: A Review

Yusuf¹,

Sudi²,

Boukar³

et al. 2021

IJACSA

View full text Add to dashboard Cite

show abstract

“…Step 4: insert the Key with the same hash address into the corresponding AVL tree and compare it with the Key value in the root node. If the queried Key is larger than the root node, it is compared with the nodes of the right subtree until the queried Key find its CDR cache and modify the CDR property [14,15]. Algorithm: Searching of key in AVL-HSSA 1: procedure SEARCH(key) 2: hash = hashValue(key) 3: key_node = searchForHash 4: if key_node is NULL then 5:…”

Section: Improved Avl-hssa Algorithmmentioning

confidence: 99%

A Signaling Monitor Scheme of RRC Protocol in 5G Road Tester

Zhang

Cheng

Deng

2021

Communications and Networking

View full text Add to dashboard Cite

Faced with the growth of massive data in the 5G network and the low query efficiency in the existing signaling synthesis algorithm, the traditional LTE/LTE-A signaling monitor scheme has been unable to satisfy with the new 5G network architecture. The Radio Resource Control (RRC) protocol is the core of the control plane, which manages and controls the wireless resources of the network. Based on this, a signaling monitor scheme of RRC protocol suitable for 5G road tester was proposed and the specific functions of its main submodule were introduced in detail. Additionally, this paper discussed an improved dynamic hash signaling synthesis algorithm based on AVL tree under a new network architecture. The tree structure is used to reduce the query time of traditional algorithm in the hash table, so as to quickly deal with hash collisions and improve the real time on the signaling synthesis. At present, the proposed scheme was applied to the real network testing of air interface data in the 5G road tester. The experimental results show that the improved algorithm can efficiently solve the issue of low efficiency of Call Detail Recording (CDR) synthesis and the average query time can be reduced by 49.3% and 33.1% compared with the two traditional algorithms. The signaling synthesis scheme described above achieves the expected effect and signaling messages in RRC protocol can be accurately decoded and monitored in real time.

show abstract