动态散列算法及其改进  

Dynamic hashing and its improvement

作　　者：李蔚[1] 陈亚峰[1] 王艳军[1] 

机构地区：[1]郑州轻工业学院计算机与通信工程学院,河南郑州450002

出　　处：《郑州轻工业学院学报（自然科学版）》2011年第3期92-95,共4页Journal of Zhengzhou University of Light Industry:Natural Science

基　　金：河南省科技厅攻关项目(0424220008)

摘　　要：对2种动态散列算法可扩展散列和线形散列进行研究,提出了允许散列后缀不等长的改进动态散列算法.改进后的动态散列算法不会产生不必要的溢出桶,散列桶的数量因而呈现线性增长,避免了因查找键分布异常而出现频繁的桶分裂及桶地址表更新现象的出现.模拟实验表明,改进后的动态散列算法明显优于可扩展散列和线性散列.Extensible hashing and linear hashing were discussed,and an improved algorithm for the hashing suffix length inequality was stated,which avoided unnecessary overflow bucket.The number of hash buckets grow linearly,which avoid splitting buckets and updating bucket address table continually,caused by unusual distribution of search key.The experiments of the simulation method showed that the improved algorithm was significantly better than extensible hashing and linear hashing.

关 键 词：动态散列 可扩展散列 线性散列 

分 类 号：TP319[自动化与计算机技术—计算机软件与理论]