New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Bloom Filters (Fast Membership Testing) #4

Open

Ja7ad opened this issue Jan 20, 2025 · 0 comments

Labels

Algorithm good first issue

Owner

Ja7ad commented Jan 20, 2025

Why? 🔍 Checks if an item probably exists in a dataset without storing everything.
Use Case: Database indexing, password breach detection, spell checking.
Example: Google’s Safe Browsing uses it to detect malicious URLs.

💡 Why is this great? → Space-efficient alternative to hash maps, used in databases & cybersecurity.

Ja7ad added good first issue Algorithm labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment