Count-Min Sketch

JD Tech

Feb 19, 2025 · Backend Development

Understanding the Design and Implementation of Caffeine Cache

This article provides a comprehensive walkthrough of Caffeine cache's architecture, explaining its fixed-size eviction policy, underlying data structures such as ConcurrentHashMap, MPSC buffers, Count‑Min Sketch frequency tracking, and the dynamic window‑probation‑protected zones, while detailing key methods like put, getIfPresent, and maintenance.

ConcurrencyCount-Min SketchEviction

0 likes · 71 min read

Understanding the Design and Implementation of Caffeine Cache

NetEase Yanxuan Technology Product Team

Jul 25, 2022 · Big Data

Probability Algorithms in Big Data: BloomFilter and Count-min Sketch Applications

The article explains how space‑efficient probabilistic structures such as BloomFilter and Count‑min Sketch enable large‑scale data deduplication, join pruning, real‑time idempotent filtering, and approximate top‑K analytics by trading modest accuracy loss for dramatically reduced storage and faster computation.

Big DataBloomFilterCount-Min Sketch

0 likes · 12 min read

Probability Algorithms in Big Data: BloomFilter and Count-min Sketch Applications