Relaxed concurrent counting bloom filters

Abstract

Counting Bloom filters are highly space-efficient with a small probability of false positives. Concurrent access to a Counting bloom filter can greatly increase its insertion and query throughput.