liveBook · Manning

Freshness

As explained in Latency

Data freshness is the degree to which data reflects the latest available state of its underlying source.

Data freshness is the degree to which data reflects the latest available state of its underlying source. Caching reduces access latency by reusing stored results, but the cached copy can lag behind the backing store. section 6.2

Freshness becomes a design trade-off when cached data is retained:

  • Non-transactional caches may expose stale data because they provide no isolation guarantees. section 6.2
  • Persistent caches survive restarts and avoid cold starts, but can increase consistency complexity between the cache and its underlying store. section 6.2
  • Time-to-live (TTL) bounds how long an entry remains valid: values that are too low reduce hit ratio, while values that are too high allow stale reads. section 6.11

Cached REST API result

A client can serve a previously computed REST API result from memory instead of making another network request. This lowers latency, but the result may no longer match the latest state in the backing store. section 6.2

How Latency covers it

How deep it goes
Explains stale reads, persistence, consistency, and TTL trade-offs, but does not provide a quantitative freshness-measurement procedure.
Examples
Uses cached REST API results and partial product-catalog copies to illustrate latency gains alongside stale-data risks.
What you can do after
Evaluate caching choices by balancing TTL, hit ratio, latency, storage, and consistency requirements.
How it connects
Connects freshness with caching, cache consistency, cache hit ratio, TTL, and backing stores.

Also explained in

Compare how 3 books explain freshness →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Latency. The section links point to the parts of the book it draws on.