Evidence Hub

Cache Lines, Not Probes: The Memory-Access Cost of Open Addressing Without Reordering

Herrera M

2026

Abstract

Abstract Farach-Colton, Krapivin, and Kuszmaul determined the probe complexity of open addressing without reordering. On real hardware, however, the cost of an operation is dominated not by the number of probes but by the number of distinct cache lines (blocks of $B$ slots) it touches. We introduce the cache-line cost model for open addressing without reordering and study the optimal number of memory accesses per operation as a function of the load $1-\delta$, the block size $B$, and the table size $n$, governed by the single parameter $\delta B$ (empty slots per block). For worst-case cost we obtain a complete, unconditional law: the smallest $W$ such that every operation touches at most $W$ lines with high probability is $\Theta(1+\log\log n/\delta B)$, achieved by asymmetric ($d$-left) bucketing and matched, in the oblivious model, by V\"ocking's balanced-allocation lower bound. Asymmetry is necessary: symmetric ($d$-greedy) bucketing is a $\log n/\log\log n$ factor worse at constant slack. Hence $O(1)$ worst-case accesses are possible if and only if $\delta B=\Omega(\log\log n)$. For expected insertion cost we prove an unconditional lower bound $\Omega(1+1/\delta B)$ and matching upper bounds: $O(1+1/\delta B)$ for $\delta B=\Omega(\log\log n)$, and $O(\delta^{-1}\log\delta^{-1})$ for all $\delta,B$. The tight law $\Theta(1+1/\delta B)$ extends to small slack under one stated hypothesis, the heavily-loaded $d$-choice full-bucket tail, which we confirm empirically. A…

Read the paper

Related studies

Go deeper in Evidence Hub

Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.

Open this study Sign up free