A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. A query returns either "possibly in set" or "definitely not in set".
-
Notifications
You must be signed in to change notification settings - Fork 0
A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. A query returns either "possibly in set" or "definitely not in set".
corradoparisi/bloom-filter
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. A query returns either "possibly in set" or "definitely not in set".
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published