正在加载内容...

963963 Chat Guide Portal Independent coverage of news

Sexed Fundamentals 6: A Practical Overview

By James Whitfield · · 1284 words
Sexed Fundamentals 6: A Practical Overview

Serving static bytes is the cheapest thing you can do at the edge. That applies to schema markup as well. In practice, schema markup 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 schema markup.

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

Configurations should be reviewable in a diff, not only in a console. This is most visible in access control. Consider access control specifically. 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.

Consider schema markup specifically. You can often replace a coordination problem with an idempotency key. Schema Markup: Anything that grows without a bound will eventually hit one. Documentation that is not tested tends to describe the previous version. That applies to schema markup as well.

Separate the outer parcel from the product’s retail packaging. A seller may place a branded product box inside a plain shipping carton, but that does not establish that the carton is opaque, sealed against viewing, or free of paperwork. Check whether packing slips, invoices or promotional inserts are included. If the answer is not published, do not assume that a plain exterior also means the contents are hidden from the recipient who opens it or from anyone with access to the delivery.

A design that cannot be rolled back is a design that cannot be changed safely. That applies to storage tiers as well. In practice, storage tiers 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 storage tiers.

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

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

The interesting number is not the average, it is the 99th percentile. The same reasoning holds for edge caching. For edge caching, 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 edge caching usually discover this the hard way. Every abstraction you add is a place where behaviour can differ from intent.

A queue smooths spikes but also hides how far behind you are. This is most visible in release process. Consider release process specifically. Retries without jitter turn a small outage into a large one. Release Process: 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 cost controls as well. In practice, cost controls 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 cost controls.

For edge caching, the constraint matters more than the feature list. The first thing to settle is the failure mode, not the happy path. Teams working on edge caching usually discover this the hard way. Measurements taken once are anecdotes; you need a baseline that repeats. Costs usually concentrate in a small number of operations, so find those first. This is most visible in edge caching.

Monitoring Alerts: A design that cannot be rolled back is a design that cannot be changed safely. Monitoring Alerts: Latency budgets are easier to defend when every hop has a stated ceiling. Monitoring Alerts: Caching helps only until the invalidation rules become the bottleneck.

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

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.

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

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

Storage Tiers: 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 storage tiers as well. In practice, storage tiers behaves differently: Failures are usually correlated, so plan for the shared dependency.

Teams working on backup strategy usually discover this the hard way. The interesting number is not the average, it is the 99th percentile. Adding a cache in front of a slow query is a fix; fixing the query is a cure. This is most visible in backup strategy. Consider backup strategy specifically. Every abstraction you add is a place where behaviour can differ from intent.

Load Balancing: Configurations should be reviewable in a diff, not only in a console. Load Balancing: 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.

The interesting number is not the average, it is the 99th percentile. The same reasoning holds for schema migration. For schema migration, 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 schema migration usually discover this the hard way. Every abstraction you add is a place where behaviour can differ from intent.

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.

If a metric has no owner, it will drift until it causes an incident. This is most visible in monitoring alerts. Consider monitoring alerts specifically. The cheapest optimisation is usually removing work nobody asked for. Monitoring Alerts: Aggregating at write time trades flexibility for predictable read cost.

The first thing to settle is the failure mode, not the happy path. This is most visible in schema markup. Consider schema markup specifically. Measurements taken once are anecdotes; you need a baseline that repeats. Schema Markup: Costs usually concentrate in a small number of operations, so find those first.

Related reading