Skip to content

This Bloom Filter implementation offers probabilistic data structure for fast set membership testing. Efficiently handling large datasets with minimal space, it ensures quick and accurate element existence checks, limits memory usage and retains speed.

Notifications You must be signed in to change notification settings

Rohan-dev-C/BloomFilter

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

About

This Bloom Filter implementation offers probabilistic data structure for fast set membership testing. Efficiently handling large datasets with minimal space, it ensures quick and accurate element existence checks, limits memory usage and retains speed.

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages