Www Independent coverage of news

Understanding Site Topics Fundamentals 2: Costs, Limits and Trade-offs

By Robert Hayes · · 1204 words
Understanding Site Topics Fundamentals 2: Costs, Limits and Trade-offs

In practice, backup strategy behaves differently: A queue smooths spikes but also hides how far behind you are. Retries without jitter turn a small outage into a large one. The same reasoning holds for backup strategy. For backup strategy, the constraint matters more than the feature list. Separating the reads from the writes buys room to change either side.

Consider crawl budget specifically. Serving static bytes is the cheapest thing you can do at the edge. Crawl Budget: A schema is an interface; changing it is a migration, not an edit. Track the denominator as carefully as the numerator. That applies to crawl budget as well.

Schema Markup: Configurations should be reviewable in a diff, not only in a console. Schema Markup: The best time to add an index is before the table gets large. Schema Markup: Failures are usually correlated, so plan for the shared dependency.

Log Analysis: If a metric has no owner, it will drift until it causes an incident. Log Analysis: The cheapest optimisation is usually removing work nobody asked for. Log Analysis: Aggregating at write time trades flexibility for predictable read cost.

Consider release process specifically. If the rollback plan needs a meeting, it is not a rollback plan. Release Process: Small pages that stay small are easier to keep fast than large ones made fast. Write the invariant down; otherwise it lives only in someone's memory. That applies to release process as well.

Access Control: Configurations should be reviewable in a diff, not only in a console. Access Control: The best time to add an index is before the table gets large. Access Control: Failures are usually correlated, so plan for the shared dependency.

Load Balancing: You can often replace a coordination problem with an idempotency key. Load Balancing: Anything that grows without a bound will eventually hit one. Load Balancing: Documentation that is not tested tends to describe the previous version.

API Design: The first thing to settle is the failure mode, not the happy path. API Design: Measurements taken once are anecdotes; you need a baseline that repeats. API Design: Costs usually concentrate in a small number of operations, so find those first.

You can also state your own boundaries. Say what you are comfortable with and what you do not want, and ask questions if an answer is unclear. Good communication is not a guarantee that everything will go as expected; it is a way to make choices more explicit and respond when circumstances change.

Observability: Configurations should be reviewable in a diff, not only in a console. Observability: The best time to add an index is before the table gets large. Observability: Failures are usually correlated, so plan for the shared dependency.

Consider load balancing specifically. A design that cannot be rolled back is a design that cannot be changed safely. Load Balancing: Latency budgets are easier to defend when every hop has a stated ceiling. Caching helps only until the invalidation rules become the bottleneck. That applies to load balancing as well.

Configurations should be reviewable in a diff, not only in a console. This is most visible in load balancing. Consider load balancing specifically. The best time to add an index is before the table gets large. Load Balancing: Failures are usually correlated, so plan for the shared dependency.

Backup Strategy: Configurations should be reviewable in a diff, not only in a console. The best time to add an index is before the table gets large. That applies to backup strategy as well. In practice, backup strategy behaves differently: Failures are usually correlated, so plan for the shared dependency.

If the rollback plan needs a meeting, it is not a rollback plan. That applies to load balancing as well. In practice, load balancing behaves differently: Small pages that stay small are easier to keep fast than large ones made fast. Write the invariant down; otherwise it lives only in someone's memory. The same reasoning holds for load balancing.

A queue smooths spikes but also hides how far behind you are. This is most visible in rate limiting. Consider rate limiting specifically. Retries without jitter turn a small outage into a large one. Rate Limiting: Separating the reads from the writes buys room to change either side.

A queue smooths spikes but also hides how far behind you are. This is most visible in api design. Consider api design specifically. Retries without jitter turn a small outage into a large one. API Design: Separating the reads from the writes buys room to change either side.

Backup Strategy: A queue smooths spikes but also hides how far behind you are. Backup Strategy: Retries without jitter turn a small outage into a large one. Backup Strategy: Separating the reads from the writes buys room to change either side.

Teams working on release process usually discover this the hard way. A design that cannot be rolled back is a design that cannot be changed safely. Latency budgets are easier to defend when every hop has a stated ceiling. This is most visible in release process. Consider release process specifically. Caching helps only until the invalidation rules become the bottleneck.

Teams working on release process usually discover this the hard way. Serving static bytes is the cheapest thing you can do at the edge. A schema is an interface; changing it is a migration, not an edit. This is most visible in release process. Consider release process specifically. Track the denominator as carefully as the numerator.

For content delivery, the constraint matters more than the feature list. A queue smooths spikes but also hides how far behind you are. Teams working on content delivery usually discover this the hard way. Retries without jitter turn a small outage into a large one. Separating the reads from the writes buys room to change either side. This is most visible in content delivery.

For crawl budget, the constraint matters more than the feature list. Periodic jobs should be safe to run twice, because they will be. Teams working on crawl budget usually discover this the hard way. You rarely need a new component to fix a boundary problem. The signal you want is often already logged, just not aggregated. This is most visible in crawl budget.

Cloud Infrastructure: If the rollback plan needs a meeting, it is not a rollback plan. Cloud Infrastructure: Small pages that stay small are easier to keep fast than large ones made fast. Cloud Infrastructure: Write the invariant down; otherwise it lives only in someone's memory.

In practice, edge caching behaves differently: If a metric has no owner, it will drift until it causes an incident. The cheapest optimisation is usually removing work nobody asked for. The same reasoning holds for edge caching. For edge caching, the constraint matters more than the feature list. Aggregating at write time trades flexibility for predictable read cost.

In practice, api design behaves differently: The first thing to settle is the failure mode, not the happy path. Measurements taken once are anecdotes; you need a baseline that repeats. The same reasoning holds for api design. For api design, the constraint matters more than the feature list. Costs usually concentrate in a small number of operations, so find those first.

Related reading