jesperborgstrup / Py-IBLTLinks
A Python implementation of Invertible Bloom Lookup Tables
☆81Updated 10 years ago
Alternatives and similar repositories for Py-IBLT
Users that are interested in Py-IBLT are comparing it to the libraries listed below
Sorting:
- Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)☆117Updated 3 weeks ago
- pythonic access to fastbit☆26Updated 7 years ago
- implementations of a counting bloom, a timing bloom and a scaling timing bloom... made for working with streams!☆42Updated 8 years ago
- ☆40Updated 8 years ago
- A Python library for learning from dimensionality reduction, supporting sparse and dense matrices.☆78Updated 8 years ago
- HAT-Trie for Python☆86Updated 9 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆119Updated last year
- Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.☆30Updated 10 years ago
- Python bindings for the fast integer compression library FastPFor.☆61Updated last year
- embedded graph datastore☆185Updated 7 years ago
- Probabilistic Data Structures in Python (originally presented at PyData 2013)☆55Updated 3 years ago
- Roaring Bitmap in Cython☆81Updated last year
- A pure Python implementation of Aho-Corasick algorithm.☆23Updated 7 years ago
- A fast Python implementation of locality sensitive hashing.☆70Updated 10 years ago
- A CUDA implementation of the Tsetlin Machine based on bitwise operators☆26Updated 6 years ago
- Python wrapper of xxhash☆34Updated 10 years ago
- A memory-based, optional-persistence naïve bayesian text classifier.☆36Updated 10 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 2 years ago
- Flow-based data pre-processing for deep learning☆31Updated 4 years ago
- ☆26Updated 8 years ago
- Scalable and Sustainable Deep Learning via Randomized Hashing☆94Updated 3 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 10 years ago
- A platform for online learning that curtails data latency and saves you cost.☆47Updated 3 years ago
- ☆24Updated 7 years ago
- Artificial Intelligence Knowledge Information Framework☆55Updated 2 years ago
- A scalable, fast, consistent graph store☆213Updated 8 years ago
- a pure-Python PATRICIA trie implementation.☆30Updated 10 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- C++ Ternary Search Tree implementation with Python bindings☆43Updated 7 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Updated 13 years ago