Primary clustering

Key takeaways

Primary clustering belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Primary clustering to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Primary clustering from memory before moving on to harder problems.

Reference excerpt

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 1 − 1 / x {\displaystyle 1-1/x} for some parameter x ≥ 2 {\displaystyle x\geq 2} , then the expected length of the run containing a given element u {\displaystyle u} is Θ ( x 2 ) {\displaystyle \Theta (x^{2})} . This causes insertions and negative queries to take expected time Θ ( x 2 ) {\displaystyle \Theta (x^{2})} in a linear-probing hash table.

Causes of primary clustering Primary clustering has two causes:

Winner keeps winning: The longer that a run becomes, the more likely it is to accrue additional elements. This causes a positive feedback loop that contributes to the clustering effect. However, this alone would not cause the quadratic blowup. Joining of runs: A single insertion may not only increase the length of the run that it is in by one, but may instead connect together two runs that were already relatively long. This is what causes the quadratic blowup in expected run length. 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 x 2 {\displaystyle x^{2}} . The expected number of items that hash into the region is ( 1 − 1 / x ) x 2 = x 2 − x {\displaystyle (1-1/x)x^{2}=x^{2}-x} . On the other hand, the standard deviation on the number of such items is Θ ( x ) {\displaystyle \Theta (x)} . It follows that, with probability Ω ( 1 ) {\displaystyle \Omega (1)} , the number of items that hash into the region will exceed the size x 2 {\displaystyle x^{2}} of the region. Intuitively, this means that regions of size Θ ( x 2 ) {\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.

Effect on performance 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 Θ ( x 2 ) {\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 Θ ( x 2 ) {\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 Θ ( x ) {\displaystyle \Theta (x)} . However, positive queries to recently-inserted elements (e.g., an element that was just inserted) take expected time Θ ( x 2 ) {\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 n / ( 2 x ) {\displaystyle n/(2x)} insertions.

Common misconceptions 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 Θ ( x ) {\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 Θ ( x 2 ) {\displaystyle \Theta (x^{2})} in expectation.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Primary clustering

Start with the simplest possible case. Write down what Primary clustering claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Primary clustering before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Primary clustering ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Primary clustering

In research: Primary clustering appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Primary clustering in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Primary clustering is common in secondary-school and first-year university syllabi. It links to neighbouring topics Hashing, so understanding it makes those chapters shorter.
In everyday life: Look for Primary clustering outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Primary clustering in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Primary clustering means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Primary clustering out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Primary clustering in simple terms?

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…

Why does Primary clustering matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Primary clustering?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Primary clustering.