Search results
48 packages found
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
- bloom
- filter
- bloom filter
- probabilistic
- datastructure
- partitionned bloom filter
- scalable bloom filter
- counting bloom filter
- invertible bloom filter
- count min sketch
- cuckoo
- xor
- minhash
- top-k
Ability to test bloom filters for ethereum.
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations.
NestJS - Redis Bloom Filters Extension
Bloom filters for javascript
A lightweight, performant bloom filter implementation with a simple API
Javascript FNV-1a Hashing Algorithm up to 1024 bits, with highly optimized 32bit and 52bit implementations.
A bloom rdf-membership-filter actor
bloom filters backed by xxhash
SHA256 + Bloom filter proof of work
Yet another Bloom filter implementation, this one with farmhash
Yet another Bloom filter implementation, this one with xxhashjs
a fast javascript counting bloom filter implementation
Minimalistic RedisBloom client for Node.js.
Bitcoin connection Bloom filtering (BIP37)
a fast javascript counting bloom filter implementation
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.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Space efficient bloom filter based on the bloom-filters npm package.
JS implementation of Bloom Filter using FastBitSet.js
- bloom
- filter
- bloom filter
- invertible bloom filter
- probabilistic
- datastructure
- count min sketch
- cuckoo
- bitset