Tight Bounds for Classical Open Addressing

Abstract

We introduce a classical open-addressed hash table, called rainbow hashing, that supports a load factor of up to $1-\epsilon$, while also supporting $O(1)$ expected-time queries, and $O(\log \log {\epsilon }^{-1})$ expected-time insertions and deletions. We further prove that this tradeoff curve is optimal: any classical open-addressed hash table that supports load factor $1-\epsilon$ must incur $\hat{I}\text{c◯}(\log \log {\epsilon }^{-1})$ expected time per operation. Finally, we extend rainbow hashing to the setting where the hash table is dynamically resized over time. Surprisingly, the addition of dynamic resizing does not come at any time cost -- even while maintaining a load factor of $\ge 1-\epsilon$ at all times, we can support $O(1)$ queries and $O(\log \log {\epsilon }^{-1})$ updates. Prior to our work, achieving any time bounds of the form $o({\epsilon }^{-1})$ for all of insertions, deletions, and queries simultaneously remained an open question.

40 pages, 3 figures, in FOCS 2024