Skip to content
Tagged articles

False Positive Rate

3 articles · Page 1 of 1
Lakehouse Research Base
Lakehouse Research Base
May 27, 2026 · Databases

Paimon Bloom Index Deep Dive: 25x Query Speedup from 38s to 1.5s with Production Best Practices

This article analyzes Paimon Bloom Index internals, demonstrates a real-world 25x query acceleration (38s to 1.5s) on a 400GB partitioned table, explains false positive rates, optimal use cases, and provides production-ready configuration patterns for StarRocks+Paimon lakehouse architectures.

Bloom IndexData EngineeringFalse Positive Rate
0 likes · 19 min read
Paimon Bloom Index Deep Dive: 25x Query Speedup from 38s to 1.5s with Production Best Practices
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.

Bloom FilterFalse Positive RateGuava
0 likes · 21 min read
Bloom Filter: Principles, False Positive Rate, and Implementations with Guava and Redis
Alibaba Cloud Developer
Alibaba Cloud Developer
Aug 15, 2018 · Artificial Intelligence

How τ‑FPL Reduces False Positives in High‑Risk Classification Tasks

τ‑FPL introduces a novel ranking‑threshold approach that explicitly incorporates a false‑positive‑rate constraint into binary classifier training, offering linear‑time optimal solutions, theoretical error bounds, and superior experimental performance on high‑risk tasks such as disease monitoring and autonomous driving.

False Positive RateNeyman-PearsonRanking
0 likes · 11 min read
How τ‑FPL Reduces False Positives in High‑Risk Classification Tasks