searchivarius / PyFastPFor
Python bindings for the fast integer compression library FastPFor.
☆58Updated last year
Alternatives and similar repositories for PyFastPFor:
Users that are interested in PyFastPFor are comparing it to the libraries listed below
- Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)☆115Updated 5 months ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated last week
- Command line interface to and serialization format for Blosc☆123Updated 2 years ago
- A C++ library providing fast language model queries in compressed space.☆129Updated 2 years ago
- Search for similar short strings☆52Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Roaring Bitmap in Cython☆81Updated 10 months ago
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- sketching algorithms implemented in chapel and python☆10Updated 7 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆86Updated 2 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- ☆36Updated 4 years ago
- HAT-Trie for Python☆86Updated 9 years ago
- Common Index File Format to to support interoperability between open-source IR engines☆32Updated 6 months ago
- Fast random number generation in an interval in Python: Up to 10x faster than random.randint.☆88Updated 6 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Python module for detection of CPU features☆28Updated 2 weeks ago
- Python bindings to Succinct Data Structure Library 2.0☆30Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆117Updated last year
- 💥 Cython bindings for MurmurHash2☆43Updated 2 months ago
- LSH index for approximate set containment search☆57Updated 2 years ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Updated 5 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago
- Interactive performance benchmarking in Jupyter☆33Updated 3 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Playing with arithmetic coding and RNNs☆22Updated 8 years ago
- Data compression using LSTM☆131Updated last year
- Transpose: SIMD Integer+Floating Point Compression Filter☆59Updated 5 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago