ekzhu / lshensembleLinks
LSH index for approximate set containment search
☆59Updated 3 years ago
Alternatives and similar repositories for lshensemble
Users that are interested in lshensemble are comparing it to the libraries listed below
Sorting:
- Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)☆107Updated 7 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆121Updated last year
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 7 months ago
- Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)☆27Updated 6 years ago
- Python bindings for the fast integer compression library FastPFor.☆61Updated 2 years ago
- Efficient set similarity search algorithms implemented in Go☆35Updated 3 years ago
- BottomK minwise hashing for streaming set similarity☆43Updated 6 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- HyperMinHash: Bringing intersections to HyperLogLog☆306Updated 7 years ago
- alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.☆49Updated 4 years ago
- Python bindings to Succinct Data Structure Library 2.0☆33Updated 6 years ago
- Roaring Bitmap in Cython☆81Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆45Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- A C++ library providing fast language model queries in compressed space.☆132Updated 2 years ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 8 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆57Updated 5 years ago
- ☆26Updated 8 years ago
- Search for similar short strings☆53Updated 5 years ago
- Final project for COS 521: Using Hokusai algorithm to approximate frequency counts of hashtags in twitter data stream.☆12Updated 10 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Your worst case is our best case.☆143Updated 8 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- A simple database optimized for returning results by custom scoring functions.☆21Updated 9 years ago
- A Brand New LSH: The fly’s olfactory circuits algorithm☆11Updated 7 years ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 4 months ago