We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

翻译：我们提出了线性探测哈希方案，该方案构建一个大小为$n$、恒定负载因子$\alpha$的哈希表，其上最坏情况下的不成功查找时间渐近几乎必然为$O(\log \log n)$。这些方案利用两条线性探测序列来为键值寻找空单元。同时，我们还获得了关于使用两条线性探测序列的任何算法所生成的最大簇大小的匹配下界。