Improved dynamic load-balanced strategy of hash table
Kai Zhao · Journal of Changsha University of Science & Technology · 2010
Network Application often requires large data storage resources,and also requires fast querying and frequent updating.Hash table supported these two operations with low cost,but it has hash conflicts.Some scholars proposed a dynamic load-balanced scheme which could improve the distribution of keywords to reduce the hash conflicts.But it dealt with the hash conflicts when it had a conflict.In this paper,the strategy was improved by dealing with load-balanced when the bandwidth was idle,so it processed the hash conflict better.It guarantees that the part of the conflict has been processed before it rised.In this article the average number of insertion decreases 24.2%.