Skip to content
/ dlbf Public

A barebones implementation of a deletable Bloom filter data structure as it is described in https://dl.acm.org/doi/10.1109/LCOMM.2010.06.100344.

License

Notifications You must be signed in to change notification settings

owenniles/dlbf

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Deletable Bloom Filter

This is an implementation of the deletable Bloom filter data structure described in this paper by Rothenberg et al.

Compile an object file by running

make

Test a particular configuration of the data structure by running a command such as

make DEFS="-DM=4096 -DR=128 -DK=16"

where M is the length of the Bloom filter in bits, K is the number of discrete hash functions that are applied to each key, and R is the number of regions in which collision-freeness is tracked.

About

A barebones implementation of a deletable Bloom filter data structure as it is described in https://dl.acm.org/doi/10.1109/LCOMM.2010.06.100344.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published