82. Design Counting at Scale with Probabilistic Data Structures

The brief

Design Counting at Scale with Probabilistic Data Structures. Unique visitors, top pages, seen URLs and p99 latency over 10 B events a day with HyperLogLog, Count-Min, Bloom filters and t-digests. Work from the scoping questions below. State assumptions for any unspecified load, guarantee or target, then trace your design end to end. Explain one difficult case and a credible alternative; the worked example is a reference, not a required implementation.

• Set the scope: How much traffic? How many things to count?
• Define the contract: What error is acceptable? How fresh, over what ranges?
• Test the boundaries: Does money depend on it? Which slices? Late events?

Constraints

Explicit scope and guarantees

Resolve the scoping questions for Counting at Scale with Probabilistic Data Structures. Separate stated behavior from assumptions, and identify what is outside your design.

Supported operating targets

Declare relevant volume, latency, freshness, quality or cost targets with units. Show calculations or an evaluation plan that can test them; unspecified targets are your assumptions, not hidden pass criteria.

Failure and boundary behavior

Explain how your guarantees hold in a difficult case relevant to this subject. Address: Which slices? Late events?

What to cover

1. 01

   Scope and behavior contract

   Identify users, required behavior and exclusions. Answer: How much traffic? How many things to count?

2. 02

   State and interfaces

   Define the information owned by the system and the inputs, outputs and errors at its boundaries. Resolve: What error is acceptable? How fresh, over what ranges?

3. 03

   Capacity and operating targets

   Estimate the dominant workload and resource demand with units and explicit assumptions. For a learned system, also state how quality is measured and what data is available.

4. 04

   Architecture and central flow

   Draw or describe the responsibilities needed for Counting at Scale with Probabilistic Data Structures. Trace a representative request, event or job from its input to a visible result; identify durable state owners.

5. 05

   Failure and boundary walkthrough

   Walk through a difficult case step by step, including detection and recovery. Consider: Does money depend on it? Which slices? Late events?

6. 06

   Tradeoffs and operations

   Compare a credible alternative using your chosen workload and guarantees. Explain a remaining risk, a signal to watch and when you would change the design.

Worked designs

Explore the architecture and decisions, then build on an example with Coach.

Official design

Design Counting at Scale with Probabilistic Data Structures

Unique visitors, top pages, seen URLs and p99 latency over 10 B events a day with HyperLogLog, Count-Min, Bloom filters and t-digests: one-hour boards for junior, senior and staff, with the theory behind them.

Explore the design

Review rubric

AI feedback uses these criteria. Scores are practice feedback.