---
title: "Discussion on \"Notes: Bloom Filters - Implementation and Real World Applications\" | Hashnode"
description: "Discussion on \"Notes: Bloom Filters - Implementation and Real World Applications\". Bloom filters are probabilistic data structures used to test whether an element is possibly in a set or definitely not in a set. These data structures are a neat hack to determine if an element is in a set without actually storing the actual data.\nA ..."
url: "https://hashnode.com/posts/bloom-filters-golang/6849bc7b3adcbcfcfe5563df"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Notes: Bloom Filters - Implementation and Real World Applications](https://btree.dev/bloom-filters-golang?utm_source=hashnode&utm_medium=feed)

Bloom filters are probabilistic data structures used to test whether an element is possibly in a set or definitely not in a set. These data structures are a neat hack to determine if an element is in a set without actually storing the actual data. A ...

Dec 21, 2022 · 3 min read · btree.dev  
Read the article

-   [#golang](https://hashnode.com/tag/golang)
-   [#bloom-filter](https://hashnode.com/tag/bloom-filter)

## Written by

[kshitij kumar](https://hashnode.com/@btree)

@btree

  
[View profile](https://hashnode.com/@btree)

Backend Engineer @ Getir

## Responses

Markdown supported · ⌘↵ to post

No responses yet.