jesperborgstrup / Py-IBLTLinks
A Python implementation of Invertible Bloom Lookup Tables
☆81Updated 11 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
- HAT-Trie for Python☆86Updated 9 years ago
- We're All Database Engineers☆15Updated 9 years ago
- ☆40Updated 8 years ago
- [DEPRECATED] You should use web3.py instead.☆10Updated 8 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆121Updated last year
- Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.☆30Updated 10 years ago
- Roaring Bitmap in Cython☆81Updated last year
- A Python library for learning from dimensionality reduction, supporting sparse and dense matrices.☆78Updated 8 years ago
- pythonic access to fastbit☆26Updated 7 years ago
- Secure distributed aggregation of high-dimensional vectors☆58Updated 8 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- A fast Python implementation of locality sensitive hashing.☆70Updated 10 years ago
- Code for the DeepScript Submission to ICFHR2016 Competition on the Classification of Medieval Handwritings in Latin Script☆17Updated 8 years ago
- ☆26Updated 8 years ago
- The Musketeer workflow manager.☆42Updated 7 years ago
- Python wrapper of xxhash☆34Updated 11 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 2 years ago
- Javascript Developer library for interacting with Computable Protocol☆28Updated 2 years ago
- A scalable, fast, consistent graph store☆213Updated 8 years ago
- A python module for generating Rabin fingerprints☆41Updated 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
- Probabilistic Data Structures in Python (originally presented at PyData 2013)☆55Updated 3 years ago
- Nearest Neighbor Search in High Dimensional Spaces☆13Updated 9 years ago
- A memory-based, optional-persistence naïve bayesian text classifier.☆36Updated 10 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- A pure Python implementation of Aho-Corasick algorithm.☆23Updated 7 years ago
- python client library☆10Updated 8 years ago
- Python3 implementation of the Kademlia DHT data store☆25Updated 7 years ago
- An implementation of RaptorQ Fountain Code as specified at http://tools.ietf.org/html/rfc6330☆21Updated 13 years ago