JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
-
Updated
Jun 11, 2024 - TypeScript
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Fully asynchronous, pure JavaScript implementation of the Parquet file format with additional features
Detect Weak password from 10,000 most used passwords using Redisbloom in sub-millisecond response times
Identity Provider for highbar
Coding Challenge #53 - Bloom Filter in TypeScript
Implementation of a bloom filter in typescript
A simple bloom filter written in typescript
Bloom filter with redisBloom module to check wheather username is taken or not
A secure pastebin-like application that enables users to create, manage, and access encrypted pastes. Features include user authentication, content encryption, unique ID generation, and click tracking, with support for Amazon S3, Redis, and PostgreSQL.
Bloom filter spellcheck written in TypeScript.
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."