摘要
介绍了双重散列函数的构造方法 ;证明了其探测序列有Θ(m2 )种并指出双重散列处理冲突时堆积很少产生 ;
This paper introduces the methods of creation of the double hash function, proves it has Θ(m 2) probing sequences, concludes that the clustering will seldom happen when collision is solved through using double hash function and analyzes its searching quality.
出处
《安徽师范大学学报（自然科学版）》
CAS
2003年第1期18-21,共4页
Journal of Anhui Normal University(Natural Science)
基金
安徽省教育厅自然科学基金资助 (2 0 0 3KJ13 9)
