散列表的一致对半探测方法

The probing method of uniform and half for HASH table

给出构造一致对半探测序列的算法 ,利用所构造的序列得到一致对半探测方法 .该方法在假设散列函数是均匀的和处理冲突后产生地址是均匀的条件下 ,和二次、随机探测方法有着相同的平均查找长度 .数值计算的结果表明 。

A method of constructing uniform and half probing sequence is proposed, with the contructed sequence, a new probing method for HASH table is obtained which is named the probing method of uniform and half. On condition that HASH function and new address derived from handling collision are symmetrical. The new method has the same average searching length compared with the probing methods of square and random, but the results obtained from a mass of numerical examples show that the method presented is more efficient and practical.