---
title: "Discussion on \"How Bloom Filters Work: The Probabilistic Set\" | Hashnode"
description: "Discussion on \"How Bloom Filters Work: The Probabilistic Set\". Can you check if a username is taken without querying the database? Yes. Bloom Filters are a space-efficient probabilistic data structure."
url: "https://hashnode.com/posts/how-bloom-filters-work/69ae362a0fe4dd6eff460430"
---

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

Discussion

# [How Bloom Filters Work: The Probabilistic Set](https://abstractalgorithms.hashnode.dev/how-bloom-filters-work?utm_source=hashnode&utm_medium=feed)

Can you check if a username is taken without querying the database? Yes. Bloom Filters are a space-efficient probabilistic data structure.

Mar 9 · 13 min read · abstractalgorithms.hashnode.dev  
Updated Jun 18  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#bloom-filter](https://hashnode.com/tag/bloom-filter)
-   [#caching](https://hashnode.com/tag/caching)
-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#system-design](https://hashnode.com/tag/system-design)

## Written by

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms)

@abstractalgorithms

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

Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.