LUA Redis scripts for a scaling bloom filter
-
Updated
Oct 23, 2018 - JavaScript
LUA Redis scripts for a scaling bloom filter
Fast, reliable cuckoo hash table for Node.js.
🧩 A streamlined bloom filter npm package for JavaScript.
high-performance, disk-backed membership engine designed for applications that demand extremely fast lookups with minimal memory usage.
Server-less feature gates that don't compromise users' privacy.
Bloom Search proof of concept and comparison.
Bloom Filter implementation in JavaScript
web application for DNA comparison, alignment and phylogenetic tree. Released on 2020.
bloom filter implementation for javascript
This project is for demonstrating the bloom filter algorithm using node.js
Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.
Asino a stubborn, simple and fast Bloom filter for the rest of us.
Adaptive bloom filter
A fast, 70-line bloom filter for JavaScript 6.
A demonstration of a bloom filter as a Node application.
🌸 Bloom filter for username existence checker using Redis Stack, ioredis, and Node.js HTTP server. Efficiently prevents duplicate usernames with fast, low-memory probabilistic checks. Easy to set up with Docker — ideal for scalable user validation! 🚀
Contains different DS and sorting algorithms with tests in javascript
A scalable and efficient username availability checker like Instagram or GitHub using Bloom Filters and Redis.
Add a description, image, and links to the bloom-filter topic page so that developers can more easily learn about it.
To associate your repository with the bloom-filter topic, visit your repo's landing page and select "manage topics."