Javascript implementation of [Bloom Filters](http://en.wikipedia.org/wiki/Bloom_filter)
Lightweight free email domain checker via Bloom filter
n-gram object searching with bloom filters
Probabilistic data structures for large or streaming data sets.
Bloom filter is a space efficient probablistic data-structure. This implementation relies on following non-cryptographic hash functions. - Fowler–Noll–Vo hash function. - Jenkins hash function.
bloomfilter-as-a-service
Most-Likely Classification Through Bloom-Filtering
Data structures for the web
A simple and fully customizable web crawler/spider for Node.js with server-side DOM. Comes with elegant and hell-simple APIs.
murmur-bloomfilter ===============================
Create bloom filters using murmurhash3
Bloom filter for Buffers, optimized for crazy speed.
scalable bloom filters
a generic bloom filter with parameterizable hash functions
Cuckoo Filter: Practically Better Than Bloom
SculeJS data structure server
This is a fork of bloomfilter.js to address a couple issues.
A bloom filter implementation
bloom filter is a probabilistic filter which SPV clients provide so we can filter the transactions we send them -- this allows for significantly more efficient transaction and block downloads
Some fast bloom filter implemented by Rust for Python and Rust!
A simple and generic bloom filter implementation.
A standard and scalable Bloom filter implementation in Rust with configurable error tolerance and automatic scaling
Scalable Bloom Filters with serde support
Simple bloom filter implementation in Rust.
A Bloom Filter implementation in Rust
Metadata-driven Parquet pruning for Rust: Skip irrelevant data before reading
The fastest bloom filter in Rust. No accuracy compromises. Use any hasher.
LevelDB-compatible filter block (Bloom filter) builder and reader used by bitcoin-rs, exposing low-level traits and utilities for constructing and querying per-block filters over SSTable-style key ranges.
A standard and scalable Bloom filter implementation in Rust with configurable error tolerance and automatic scaling
A fast Bloom Filter library for Ruby for unices.
A simple BloomFilter implementation, usable in-process or as an EventMachine daemon.
Bloom filter implementation using a bit array with double hashing. Supports configurable expected items and false positive rate, merge, serialization, and memory usage reporting.
Fast Bloom filter in C and Ruby.
Memory-efficient scalable Bloom Filter that grows dynamically. No upfront capacity needed. 20-50x less memory than Set, perfect for Rails apps.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.