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 2 months ago
- implementations of a counting bloom, a timing bloom and a scaling timing bloom... made for working with streams!☆42Updated 8 years ago
- HAT-Trie for Python☆86Updated 9 years ago
- pythonic access to fastbit☆26Updated 6 years ago
- We're All Database Engineers☆15Updated 9 years ago
- ☆40Updated 8 years ago
- Roaring Bitmap in Cython☆81Updated last year
- A CUDA implementation of the Tsetlin Machine based on bitwise operators☆26Updated 5 years ago
- Python bindings for the fast integer compression library FastPFor.☆60Updated last year
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆57Updated 2 years ago
- Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.☆30Updated 10 years ago
- embedded graph datastore☆184Updated 7 years ago
- Flow-based data pre-processing for deep learning☆31Updated 4 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆117Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- asyncio RAFT algorithm bassed on aiohttp☆30Updated 9 years ago
- A super-fast ORM backed by Redis, supporting models and indexes with O(1) searches, and support for storing native/complex types and obje…☆18Updated 6 years ago
- A fast Python implementation of locality sensitive hashing.☆70Updated 10 years ago
- ☆26Updated 8 years ago
- Python library for handling efficiently sorted integer sets.☆215Updated last month
- Probabilistic Data Structures in Python (originally presented at PyData 2013)☆55Updated 3 years ago
- A Python library for learning from dimensionality reduction, supporting sparse and dense matrices.☆78Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Code for generating analyses found in "Analyzing Log Analysis: An Empirical Study of User Log Mining" to appear in LISA 2014.☆8Updated 10 years ago
- Ping the world!☆82Updated 10 years ago
- A pure Python implementation of Aho-Corasick algorithm.☆22Updated 7 years ago
- Simhashing in C++☆135Updated 2 years ago
- ☆20Updated 11 months ago
- A memory-based, optional-persistence naïve bayesian text classifier.☆36Updated 10 years ago
- ☆24Updated 7 years ago