Cache hit
A cache hit occurs when a requested item is found in a cache and can be returned without accessing its original source or recomputing it.
Latency
A cache hit occurs when requested data is found in the cache and can be returned without accessing the backing store.
- How it is used
- Uses a cache lookup to bypass backing-store access and reduce latency when requested data is present.
- How deep it goes
- Defines hits, contrasts misses, explains hit-to-miss ratio, and traces cache-aside handling without detailing replacement-policy algorithms.
- Examples
- Uses user IDs, database records, JSON values, Redis, and REST API searches as concrete caching contexts.
- What you can do after
- Apply it via cache-aside caching by checking a key, reading a hit, or fetching and storing a miss.
Advanced Algorithms and Data Structures
A cache hit occurs when a requested data item is present in the cache and can be accessed there.
- How it is used
- Handles repeated cache requests by reusing stored data and refreshing recency in an LRU cache.
- How deep it goes
- Explains lookup, node movement, pointer preservation, and constant-time list operations, while deferring hash computation costs.
- Examples
- Uses the EvilCorp update and diagrams of hash-table lookup, list movement, and node relinking.
- What you can do after
- Build it from scratch by combining hash-table lookup with doubly-linked-list reordering.
Read how Advanced Algorithms and Data Structures explains cache hit →
100 Go Mistakes and How to Avoid Them
A cache hit occurs when a requested memory location is found in the cache being checked.
- How it is used
- Explains why adjacent memory accesses can be served quickly after the CPU loads a cache line.
- How deep it goes
- Defines hits through a 16-element slice example, but defers detailed CPU caching strategies.
- Examples
- Uses Go functions summing 16 int64 slice elements and tracks hits across two loaded memory blocks.
- What you can do after
- Evaluate sequential slice access by distinguishing compulsory misses from subsequent cache hits.
Read how 100 Go Mistakes and How to Avoid Them explains cache hit →
Related concepts
- lazy initializationproduced by · Lazy initialization is a technique that postpones creating, retrieving, computing, or loading a value or resource until it is needed.
- cache misscontrasts with · A cache miss occurs when a lookup or access finds no usable requested item in the relevant cache, requiring retrieval or computation elsewhere.
- cachinguses · Caching is the practice of storing reusable data or computation results so later access can avoid repeating retrieval or computation.
- conditional logicused by · Conditional logic is a programming technique that selects execution paths, actions, or result values according to evaluated conditions.
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.