zouxiang1993 / xorfilter Goto Github PK

Implementation of Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters in rust-lang, Journal of Experimental Algorithmics (to appear).

This package is a port from its golang implementation.

Add the following under project's Cargo.toml:

[dependencies]
xorfilter-rs = "0.2.0"

or

[dependencies]
xorfilter-rs = { git = "https://github.com/bnclabs/xorfilter" }

use xorfilter::Xor8;

let mut keys: Vec<u64> = vec![];
for _ in 0..num_keys {
    keys.push(rng.gen());
}

let mut filter = Xor8::new(); // new filter.
filter.populate_keys(&keys); // populate keys.
filter.build(); // build bitmap.

for key in 0..lookup {
    // there can be false positives, but no false negatives.
    filter.contains_key(key);
}

• Serialize / Deserialize Xor8 type.
• Incrementally adding keys to a pre-built Xor8 instance.
• Gather benchmark results for other implementations - Go, C, C++, Erlang, Java, Python.

Following are the results for a set of 10-million u64 keys:

• Build time is measured in Seconds, for 10 million entries.
• Membership is measured in Nanosec, for single lookup in a set of 10 million entries.
• FPP = False Positive Probability measured in percentage

• Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
• Blog post by Daniel Lemire

• Simple workflow. Fork - Modify - Pull request.
• Before creating a PR,
  • Run make build to confirm all versions of build is passing with 0 warnings and 0 errors.
  • Run check.sh with 0 warnings, 0 errors and all test-cases passing.
  • Run perf.sh with 0 warnings, 0 errors and all test-cases passing.
  • Install and run cargo spellcheck to remove common spelling mistakes.
• Developer certificate of origin is preferred.