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

Observability: Periodic jobs should be safe to run twice, because they will be. Observability: You rarely need a new component to fix a boundary problem. Observability: The signal you want is often already logged, just not aggregated.

Teams working on edge caching usually discover this the hard way. You can often replace a coordination problem with an idempotency key. Anything that grows without a bound will eventually hit one. This is most visible in edge caching. Consider edge caching specifically. Documentation that is not tested tends to describe the previous version.

Search Indexing: Serving static bytes is the cheapest thing you can do at the edge. Search Indexing: A schema is an interface; changing it is a migration, not an edit. Search Indexing: Track the denominator as carefully as the numerator.

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

Rate Limiting: The interesting number is not the average, it is the 99th percentile. Rate Limiting: Adding a cache in front of a slow query is a fix; fixing the query is a cure. Rate Limiting: Every abstraction you add is a place where behaviour can differ from intent.

Search Indexing: If a metric has no owner, it will drift until it causes an incident. The cheapest optimisation is usually removing work nobody asked for. That applies to search indexing as well. In practice, search indexing behaves differently: Aggregating at write time trades flexibility for predictable read cost.

A design that cannot be rolled back is a design that cannot be changed safely. The same reasoning holds for cloud infrastructure. For cloud infrastructure, the constraint matters more than the feature list. Latency budgets are easier to defend when every hop has a stated ceiling. Teams working on cloud infrastructure usually discover this the hard way. Caching helps only until the invalidation rules become the bottleneck.

API Design: Periodic jobs should be safe to run twice, because they will be. API Design: You rarely need a new component to fix a boundary problem. API Design: The signal you want is often already logged, just not aggregated.

Configurations should be reviewable in a diff, not only in a console. This is most visible in schema migration. Consider schema migration specifically. The best time to add an index is before the table gets large. Schema Migration: 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.

Periodic jobs should be safe to run twice, because they will be. This is most visible in storage tiers. Consider storage tiers specifically. You rarely need a new component to fix a boundary problem. Storage Tiers: The signal you want is often already logged, just not aggregated.

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

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

Consent is an ongoing, voluntary agreement, not a one-time permission that applies to everything. It can be changed or withdrawn, and agreement to one activity does not automatically mean agreement to another. A person who is asleep or unable to make a clear, voluntary choice cannot provide consent; legal definitions and capacity rules vary by country. When either person seems uncertain, stop and ask rather than treating silence as agreement.

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

A design that cannot be rolled back is a design that cannot be changed safely. That applies to data pipelines as well. In practice, data pipelines behaves differently: Latency budgets are easier to defend when every hop has a stated ceiling. Caching helps only until the invalidation rules become the bottleneck. The same reasoning holds for data pipelines.

A check-up does not necessarily include a physical examination. Many screening visits rely on questions, urine or swab samples, and blood tests; an examination is considered when it is relevant to the person’s concerns or clinical assessment. Patients can ask what an examination involves and discuss consent before it begins.

Observability: The interesting number is not the average, it is the 99th percentile. Observability: Adding a cache in front of a slow query is a fix; fixing the query is a cure. Observability: Every abstraction you add is a place where behaviour can differ from intent.

Rate Limiting: A queue smooths spikes but also hides how far behind you are. Rate Limiting: 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.

For rate limiting, the constraint matters more than the feature list. Configurations should be reviewable in a diff, not only in a console. Teams working on rate limiting usually discover this the hard way. The best time to add an index is before the table gets large. Failures are usually correlated, so plan for the shared dependency. This is most visible in rate limiting.

In practice, data pipelines 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 data pipelines. For data pipelines, the constraint matters more than the feature list. Separating the reads from the writes buys room to change either side.

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

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

In practice, monitoring alerts behaves differently: 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. The same reasoning holds for monitoring alerts. For monitoring alerts, the constraint matters more than the feature list. Failures are usually correlated, so plan for the shared dependency.