Search results
19 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
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
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
- bloom filter
- canberra
- caverphone
- chebyshev
- cologne
- cosine
- clustering
- daitch-mokotoff
- dice
- fingerprint
- fuzzy
- hamming
- k-means
- jaccard
- View more
Fast bloom filter in JavaScript.
Fast bloom filter in JavaScript.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Bloom Filter using the FNV hash function
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.
A bloom filter with pluggable hashing designed for serialization.
Probabilistic data structures for large or streaming data sets.
Fast, efficient and easy to use Bloom filter.
Bloom Filter implementation at the tip of your require.
JS implementation of Bloom Filter using FastBitSet.js
- bloom
- filter
- bloom filter
- invertible bloom filter
- probabilistic
- datastructure
- count min sketch
- cuckoo
- bitset
Hirachical bloom classifier
Yet another Bloom filter implementation, this one with farmhash
Yet another Bloom filter implementation, this one with xxhashjs
Computing and querying HTTP/2 Cache Digest data structures
This is a fork of bloomfilter.js to address a couple issues.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
bloom filter