A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. For example, checking availability of username is set membership problem, where the set is the list of all registered username.
-
Notifications
You must be signed in to change notification settings - Fork 0
A Bloom filter implementation. It is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
License
ilkhom19/bloom_filter
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A Bloom filter implementation. It is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published