From 33b6b38198502acfcf5d3202707ef5b0f190d94a Mon Sep 17 00:00:00 2001 From: Stephen Lee Date: Mon, 4 Aug 2025 08:01:41 -0400 Subject: [PATCH] Correct Bloom Filter description regarding their lack of false negatives. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 3ba8b6d..7760e1f 100644 --- a/README.md +++ b/README.md @@ -9,7 +9,7 @@ This library is used by popular systems such as [Milvus](https://github.com/milv A Bloom filter is a concise/compressed representation of a set, where the main requirement is to make membership queries; _i.e._, whether an item is a member of a set. A Bloom filter will always correctly report the presence -of an element in the set when the element is indeed present. A Bloom filter +of an element in the set when the element is definitely not present. A Bloom filter can use much less storage than the original set, but it allows for some 'false positives': it may sometimes report that an element is in the set whereas it is not.