ekzhu / lshensemble
LSH index for approximate set containment search
☆57Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for lshensemble
- Code and Benchmarks for JOSIE (SIGMOD 2019)☆18Updated last year
- Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)☆101Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 6 months ago
- MonetDB as a shared library with a C API☆33Updated 2 years ago
- Python bindings for the fast integer compression library FastPFor.☆57Updated last year
- Efficient set similarity search algorithms implemented in Go☆29Updated 2 years ago
- BottomK minwise hashing for streaming set similarity☆42Updated 5 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 9 years ago
- Minhash LSH in Golang☆25Updated 5 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆114Updated 11 months ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 7 years ago
- A Jupyter notebook extension to centralize and manage data☆14Updated last year
- A General-Purpose Counting Filter: Counting Quotient Filter☆126Updated last year
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆53Updated 2 years ago
- alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.☆49Updated 3 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated 4 months ago
- simd enabled column imprints☆11Updated 6 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆10Updated 7 years ago
- ☆11Updated 7 years ago
- Explaining Inference Queries with Bayesian Optimization☆10Updated 3 years ago
- Implementation of many similarity join algorithms.☆15Updated 10 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- Implementation of QuadSketch algorithm☆11Updated last year
- A simple database optimized for returning results by custom scoring functions.☆20Updated 8 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 6 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- Teaching implementation of the TurboPFor integer compression algorithm☆22Updated 5 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago