---
title: "Discussion on \"Understanding Bloom Filter\" | Hashnode"
description: "Discussion on \"Understanding Bloom Filter\". It is a probabilistic space-efficient data structure with O(1) insertion and retrieval. It is used to find if a key exists (with false positives) or not (no false negatives). It can be used as a data layer to check if a key exists before querying the..."
url: "https://hashnode.com/posts/understanding-bloom-filter/657b08753f7a57da8adb0e74"
---

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

Discussion

# [Understanding Bloom Filter](https://surabhisuman.in/understanding-bloom-filter?utm_source=hashnode&utm_medium=feed)

It is a probabilistic space-efficient data structure with O(1) insertion and retrieval. It is used to find if a key exists (with false positives) or not (no false negatives). It can be used as a data layer to check if a key exists before querying the...

Dec 14, 2023 · 2 min read · surabhisuman.in  
Read the article

-   [#databases](https://hashnode.com/tag/databases)
-   [#bloom-filter](https://hashnode.com/tag/bloom-filter)
-   [#probabilistic-data-structure](https://hashnode.com/tag/probabilistic-data-structure)

## Written by

[Surabhi Suman](https://hashnode.com/@surabhisuman)

@surabhisuman

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

Hey! I am a software engineer by profession. Passionate about Ruby, Database internals, optimization, distributed systems

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
