摘要
网络应用中经常需要大量的数据存储资源以及快速查询和频繁修改的操作.哈希表是可以存储大量数据的资源,它可以支持这两种操作,并且花费很少,但是存在哈希冲突.因此,有人提出了动态负载平衡策略来改善关键字的分布,从而减少冲突次数.但是,这种策略只是在产生冲突的时候才进行冲突处理.本研究优化了这种策略,在带宽空闲时进行负载平衡处理,从而更好地处理哈希冲突,保证了部分冲突在其产生之前已经得到处理,改进后的策略平均插入次数减少了24.2%.
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%.
出处
《长沙理工大学学报（自然科学版）》
CAS
2010年第1期68-72,共5页
Journal of Changsha University of Science and Technology:Natural Science
基金
湖南省自然科学基金资助项目(09JJ6094)
关键词
动态负载平衡
平均插入次数
哈希冲突
dynamic load-balanced
the average number of insertion
hash conflicts
