Fast Aproximate Filters

About

Fast filters to check whether an element is in the set. These data structures are probabilistic, meaning they have certain probability for false positives, but they are never wrong when item was actually in the initial set. What is more, space usage and speed of access is excellent for these data structures.

This Julia package is based of binaryfusefilter.h. Currently only binary fuse filters are re-implemented, but we support UInt8, UInt16 and UInt32 fingerprints.

Feel free to make a PR with other implementations.

Citations

If using this code for scientific settings please cite the relevant papers:

• Thomas Mueller Graf, Daniel Lemire, Binary Fuse Filters: Fast and Smaller Than Xor Filters (in preparation)
• Thomas Mueller Graf, Daniel Lemire, Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters, Journal of Experimental Algorithmics 25 (1), 2020. DOI: 10.1145/3376122

Usage

using FastFilter
?BinaryFuseFilter