In computer programming, primary clustering is a phenomenon that causes performance degradation in linear-probing hash tables. The phenomenon states that, as elements are added to a linear probing hash table, they have a tendency to cluster together into long runs (i.e., long contiguous regions of the hash table that contain no free slots). If the hash table is at a load factor of ${\displaystyle 1-1/x}$ for some parameter ${\displaystyle x\geq 2}$, then the expected length of the run containing a given element ${\displaystyle u}$ is ${\displaystyle \Theta (x^{2})}$. This causes insertions and negative queries to take expected time ${\displaystyle \Theta (x^{2})}$ in a linear-probing hash table.

Primary clustering has two causes:

Another way to understand primary clustering is by examining the standard deviation on the number of items that hash to a given region within the hash table. Consider a sub-region of the hash table of size ${\displaystyle x^{2}}$. The expected number of items that hash into the region is ${\displaystyle (1-1/x)x^{2}=x^{2}-x}$. On the other hand, the standard deviation on the number of such items is ${\displaystyle \Theta (x)}$. It follows that, with probability ${\displaystyle \Omega (1)}$, the number of items that hash into the region will exceed the size ${\displaystyle x^{2}}$ of the region. Intuitively, this means that regions of size ${\displaystyle \Theta (x^{2})}$ will often overflow, while larger regions typically will not. This intuition is often used as the starting point for formal analyses of primary clustering.

Primary clustering causes performance degradation for both insertions and queries in a linear probing hash table. Insertions must travel to the end of a run, and therefore take expected time ${\displaystyle \Theta (x^{2})}$. Negative queries (i.e., queries that are searching for an element that turns out not to be present) must also travel to the end of a run, and thus also take expected time ${\displaystyle \Theta (x^{2})}$. Positive queries can terminate as soon as they find the element that they are searching for. As a result, the expected time to query a random element in the hash table is ${\displaystyle \Theta (x)}$. However, positive queries to recently-inserted elements (e.g., an element that was just inserted) take expected time ${\displaystyle \Theta (x^{2})}$.

These bounds also hold for linear probing with lazy deletions (i.e., using tombstones for deletions), as long as the hash table is rebuilt (and the tombstones are cleared out) semi-frequently. It suffices to perform such a rebuild at least once every ${\displaystyle n/(2x)}$ insertions.

Many textbooks describe the winner-keeps-winning effect (in which the longer a run becomes, the more likely it is to accrue additional elements) as the sole cause of primary clustering. However, as noted by Knuth, this is not the main cause of primary clustering.

Some textbooks state that the expected time for a positive query is ${\displaystyle \Theta (x)}$, typically citing Knuth. This is true for a query to a random element. Some positive queries may have much larger expected running times, however. For example, if one inserts an element and then immediately queries that element, the query will take the same amount of time as did the insertion, which is ${\displaystyle \Theta (x^{2})}$ in expectation.

Ordered linear probing (often referred to as Robin Hood hashing) is a technique for reducing the effects of primary clustering on queries. Ordered linear probing sorts the elements within each run by their hash. Thus, a query can terminate as soon as it encounters any element whose hash is larger than that of the element being queried. This results in both positive and negative queries taking expected time ${\displaystyle O(x)}$.