Topic
Caching
Learn Caching as a connected topic across chapters, concepts, simulations, and interview reasoning.
10 Concepts7 Articles2h 27m
Overview
Learn Caching as a connected topic across chapters, concepts, simulations, and interview reasoning.
How this topic helps
System Design
Data Structures
Distributed Systems
Performance
Learning Path in this Topic
Series that contain articles from Caching. Select a path to filter the article list.
Articles
7 matched articles
Article 1Caching and Persistence in Spark: Storage Levels and When to Use ThemTLDR: Calling cache() or persist() does not immediately store anything — Spark caches lazily at the first action, partition by partition, managed by a per-executor BlockManager. When memory fills up, 24 minArticle 2System Design: Complete Guide to Caching — Patterns, Eviction, and Distributed StrategiesTLDR: Caching is the single highest-leverage performance tool in distributed systems. This guide covers every read/write pattern (Cache-Aside through Refresh-Ahead), every eviction policy (LRU through33 min
Article 3Redis Sorted Sets Explained: Skip Lists, Scores, and Real-World Use CasesTLDR: Redis Sorted Sets (ZSETs) store unique members each paired with a floating-point score, kept in sorted order at all times. Internally they use a skip list for O(log N) range queries and a hash t20 min
Article 4Write-Time vs Read-Time Fan-Out: How Social Feeds ScaleTLDR: Fan-out is the act of distributing one post to many followers' feeds. Write-time fan-out (push) pre-computes feeds at post time — fast reads but catastrophic write amplification for celebrities.18 minArticle 5LLD for LRU Cache: Designing a High-Performance CacheTLDR
TLDR: An LRU (Least Recently Used) Cache evicts the item that hasn't been accessed the longest when it's full. The classic implementation combines a HashMap (O(1) lookup) with a Doubly Linked Li25 minArticle 6How Bloom Filters Work: The Probabilistic SetTLDR
TLDR: A Bloom Filter is a bit array + multiple hash functions that answers "Is X in the set?" in \(O(1)\) constant space. It can return false positives (say "yes" when the answer is "no") but ne13 minPage 1 of 2