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)$。该方案采用两条线性探测序列来为键寻找空单元。同时，还获得了任意使用两条线性探测序列的算法所产生的最大簇大小的匹配下界。