Cache key
A cache key is an identifier associated with a request, input, or configuration that distinguishes and selects a corresponding cached value or computation result.
Latency
A cache key is an identifier derived from a request or function input that selects a corresponding cached result.
- How it is used
- Uses request or input identifiers to retrieve cached values and avoid repeated backing-store lookups or expensive computation.
- How deep it goes
- Explains hits, misses, expiration, cache updates, and hit-to-miss measurement through a cache-aside workflow.
- Examples
- Uses user IDs as keys for JSON-encoded user information and illustrates database fallback after a miss.
- What you can do after
- Apply cache-aside caching by choosing a lookup key, handling misses, querying the backing store, and updating the cache.
Building Web APIs with ASP.NET Core
A cache key is an identifier that distinguishes a cached entry associated with a particular request or data variant.
- How it is used
- Uses request parameters to select the correct in-memory result before querying the database.
- How deep it goes
- Defines key construction and cache-or-query flow, but does not develop broader cache-key design concerns.
- Examples
- Demonstrates a BoardGamesController key combining a request type name with serialized request data.
- What you can do after
- Apply it via IMemoryCache to prevent mismatched responses and avoid repeated EF Core queries.
Read how Building Web APIs with ASP.NET Core explains cache key →
GitHub Actions in Action: Continuous integration and delivery for DevOps
A cache key is an identifier that determines which stored cache entry a request retrieves or replaces.
- How it is used
- Uses identifiers to reuse dependencies, artifacts, and container layers while reducing workflow time and costs.
- How deep it goes
- Explains key composition, lockfile-based invalidation, restore prefixes, and SHA-256 hashing without detailing cache-service internals.
- Examples
- Uses npm, NuGet, and Docker cache configurations, including keys derived from runner.os and packages.lock.json.
- What you can do after
- Operate/configure GitHub Actions caches with deterministic keys, restore prefixes, and lockfile-driven invalidation.
Related concepts
- cachingused by · Caching is the practice of storing reusable data or computation results so later access can avoid repeating retrieval or computation.
- memoizationused by · Memoization is an optimization technique that stores computation results with their inputs so equivalent later evaluations can reuse them without recomputation.
- hash valueproduces · A hash value is a deterministic, typically fixed-size value produced by applying a hash function to input data, often for lookup, comparison, identification, or integrity checking.
- generationconfigures · Generation is the computational production of outputs from supplied inputs or context, often by applying a model to produce predictions or new content.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.