根据探查序列的规则
线性探查法
h(key) mod M, (h(key)+1)mod M, ....., h_i = (h(key)+i) mod M
伪随机探查法
y0=h(key), y_i+1 = (y_i + p) mod M
y0为伪随机树发生器的初值，p为与M接近的素数
二次探查法
h0(key), h1(key), ...., h2i-1(key), h2i(key)
h0(key) = h(key)
h2i-1(key) = (h(key)+i^2) mod M
h2i(key) = (h(key)-i^2) mod M
双散列法
Hi = (h1(key) + i*h2(key)) mod M, i = 0,1,2,
