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
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 6 months ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆119Updated last year
- BottomK minwise hashing for streaming set similarity☆43Updated 6 years ago
- Efficient set similarity search algorithms implemented in Go☆35Updated 3 years ago
- Python bindings for the fast integer compression library FastPFor.☆61Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 10 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)☆26Updated 6 years ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 8 years ago
- alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.☆49Updated 4 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆305Updated 7 years ago
- Code and Benchmarks for JOSIE (SIGMOD 2019)☆19Updated 2 years ago
- MonetDB as a shared library with a C API☆32Updated 3 years ago
- A C++ library providing fast language model queries in compressed space.☆132Updated 2 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- An implementation of efficient LSH inspired by fruit fly brain☆87Updated 6 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆44Updated 2 years ago
- Search for similar short strings☆53Updated 5 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
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash☆56Updated 5 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 5 years ago
- A Brand New LSH: The fly’s olfactory circuits algorithm☆11Updated 7 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 2 years ago
- Your worst case is our best case.☆141Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago