A Field Guide to Site Topics Fundamentals 3

Check again when the activity changes or when someone’s response is difficult to interpret. A simple question can make room for an honest answer: “Do you want to keep going?” If the answer is uncertain, stop and give the person space. Hesitation is not an invitation to persuade them.

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

The interesting number is not the average, it is the 99th percentile. The same reasoning holds for access control. For access control, the constraint matters more than the feature list. Adding a cache in front of a slow query is a fix; fixing the query is a cure. Teams working on access control usually discover this the hard way. Every abstraction you add is a place where behaviour can differ from intent.

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

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

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

Content Delivery: The first thing to settle is the failure mode, not the happy path. Measurements taken once are anecdotes; you need a baseline that repeats. That applies to content delivery as well. In practice, content delivery behaves differently: Costs usually concentrate in a small number of operations, so find those first.

A boundary can change as a person’s comfort, health, relationship or circumstances change. Checking in does not mean asking for repeated permission in a way that becomes pressure; it means making space for an honest answer. Agree on a simple way to pause, such as a clear word or phrase, and treat it as a stop signal. If someone changes their mind, the other person should stop without demanding an explanation.

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

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

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

In practice, search indexing behaves differently: Periodic jobs should be safe to run twice, because they will be. You rarely need a new component to fix a boundary problem. The same reasoning holds for search indexing. For search indexing, the constraint matters more than the feature list. The signal you want is often already logged, just not aggregated.

Release Process: 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. Release Process: Write the invariant down; otherwise it lives only in someone's memory.

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

In practice, access control 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 access control. For access control, the constraint matters more than the feature list. Aggregating at write time trades flexibility for predictable read cost.

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

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

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

Serving static bytes is the cheapest thing you can do at the edge. That applies to data pipelines as well. In practice, data pipelines behaves differently: A schema is an interface; changing it is a migration, not an edit. Track the denominator as carefully as the numerator. The same reasoning holds for data pipelines.

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

Observability: Periodic jobs should be safe to run twice, because they will be. You rarely need a new component to fix a boundary problem. That applies to observability as well. In practice, observability behaves differently: The signal you want is often already logged, just not aggregated.

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.

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.

If the rollback plan needs a meeting, it is not a rollback plan. That applies to schema migration as well. In practice, schema migration 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 schema migration.