BestHub
Sign in
Tagged articles

probabilistic data structure

15 articles · Page 1 of 1
Subtle Storm
Subtle Storm
Jun 14, 2026 · Fundamentals

Master Bloom Filters in 10 Minutes: How They Prevent Cache Penetration

A Bloom filter is a probabilistic data structure that answers set‑membership queries with guaranteed no false negatives but possible false positives, using a bit array and multiple hash functions; the article demonstrates its mechanics with examples and shows its use in preventing cache penetration, URL de‑duplication, accelerating distributed databases, and handling blacklists, while noting drawbacks like no deletion and limited scalability.

Bloom filterCache PenetrationURL deduplication
0 likes · 8 min read
Master Bloom Filters in 10 Minutes: How They Prevent Cache Penetration
Java Backend Full-Stack
Java Backend Full-Stack
Mar 17, 2025 · Fundamentals

How Redis Implements Bloom Filters to Prevent Cache Penetration

The article explains the probabilistic Bloom filter data structure, its initialization, hash‑based insertion and query process, illustrates collisions with concrete examples, and shows how Redis (via Redisson) supports Bloom filters with Java code to efficiently block cache‑penetration attacks.

Bloom filterCache PenetrationRedisson
0 likes · 6 min read
How Redis Implements Bloom Filters to Prevent Cache Penetration
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Dec 18, 2024 · Fundamentals

Understanding Bloom Filters and Their Support in Redis

This article explains the probabilistic Bloom filter data structure, its characteristics and typical use cases such as cache‑penetration prevention, details its simple implementation steps, demonstrates how Redis (via Redisson) provides built‑in Bloom filter support with Java code examples, and summarizes its practical benefits.

Bloom filterCache PenetrationJava
0 likes · 7 min read
Understanding Bloom Filters and Their Support in Redis
JD Cloud Developers
JD Cloud Developers
Nov 7, 2024 · Fundamentals

Unlocking Fast Set Membership: Bloom & Cuckoo Filters Explained

This article introduces Bloom filters and Cuckoo filters, explains their probabilistic nature, false‑positive behavior, space‑time trade‑offs, provides Go and Java implementation examples, and discusses practical use cases such as Redis extensions and high‑traffic e‑commerce scenarios.

Bloom filterCuckoo FilterRedis
0 likes · 16 min read
Unlocking Fast Set Membership: Bloom & Cuckoo Filters Explained
Sohu Tech Products
Sohu Tech Products
Apr 10, 2024 · Big Data

Bloom Filter: Principles, False Positive Rate, and Implementations with Guava and Redis

Bloom filters are space‑efficient probabilistic structures that answer “definitely not” or “maybe” membership queries, with a controllable false‑positive rate derived from bit array size, element count, and hash functions, and can be implemented via Guava’s Java library, Redisson’s Redis wrapper, native Redis modules, or custom bitmap code, dramatically reducing memory usage and latency in large‑scale systems such as URL deduplication or user‑product checks.

Big DataBloom filterGuava
0 likes · 21 min read
Bloom Filter: Principles, False Positive Rate, and Implementations with Guava and Redis
Zhuanzhuan Tech
Zhuanzhuan Tech
Mar 22, 2024 · Backend Development

Comprehensive Guide to Bloom Filters: Principles, Implementations, and Business Applications

This article introduces Bloom filters, explains their probabilistic principles, advantages and drawbacks, details how to add and query elements, derives false‑positive formulas, provides Guava, Redisson, Redis‑module, and custom bitmap implementations with code samples, and showcases real‑world business scenarios and performance benefits.

Bloom filterGuavaJava
0 likes · 28 min read
Comprehensive Guide to Bloom Filters: Principles, Implementations, and Business Applications
IT Services Circle
IT Services Circle
May 2, 2023 · Fundamentals

Bloom Filter: Principles, Guava & Redisson Implementations, and Practical Usage

This article explains the Bloom filter data structure, its mathematical foundations and false‑positive analysis, demonstrates how to implement it with Google Guava and Redisson in Java, and discusses practical considerations such as cache‑penetration mitigation, deletion strategies, and periodic rebuilding.

Bloom filterCache PenetrationGuava
0 likes · 15 min read
Bloom Filter: Principles, Guava & Redisson Implementations, and Practical Usage
JD Cloud Developers
JD Cloud Developers
Feb 3, 2023 · Fundamentals

Unlocking the Secrets of Skip Lists: Theory, Implementation, and Performance Analysis

This article provides a comprehensive, formal introduction to skip lists, covering their probabilistic foundations, structural design, detailed C implementations for creation, search, insertion, deletion, random level generation, space and time complexity analyses, and extensions such as fast random access and span maintenance.

AlgorithmComplexity AnalysisSkip List
0 likes · 22 min read
Unlocking the Secrets of Skip Lists: Theory, Implementation, and Performance Analysis
Tencent Cloud Developer
Tencent Cloud Developer
Jul 21, 2021 · Big Data

Bloom Filter: Introduction, Theory, Construction, Query, and Applications

The article explains Bloom filters—a probabilistic, space‑efficient data structure using multiple hash functions on a bit array to answer set‑membership queries with controllable false‑positive rates, detailing their construction, query process, optimal parameters, and common uses such as URL deduplication, cache protection, and spam filtering.

Big DataBloom filterCache Optimization
0 likes · 8 min read
Bloom Filter: Introduction, Theory, Construction, Query, and Applications
Top Architect
Top Architect
Dec 18, 2020 · Fundamentals

Understanding Bloom Filters: Principles, Applications, and Java Implementations with Guava and Redis

This article explains Bloom filters, their core principles, typical use cases like cache penetration and large‑scale membership testing, and demonstrates practical Java implementations using Guava and Redis, including code examples, performance analysis, and discussion of their advantages and limitations.

Bloom filterCache PenetrationGuava
0 likes · 12 min read
Understanding Bloom Filters: Principles, Applications, and Java Implementations with Guava and Redis
ITFLY8 Architecture Home
ITFLY8 Architecture Home
Apr 9, 2017 · Fundamentals

Understanding Bloom Filters: Fast, Space-Efficient Membership Tests

Bloom filters are highly space-efficient probabilistic data structures that quickly test set membership using multiple hash functions, guaranteeing no false negatives while allowing a small false positive rate, making them ideal for large-scale applications such as email blacklists and massive URL deduplication.

Big DataBloom filtermembership testing
0 likes · 5 min read
Understanding Bloom Filters: Fast, Space-Efficient Membership Tests