ekzhu / lshensembleLinks
LSH index for approximate set containment search
☆57Updated 2 years ago
Alternatives and similar repositories for lshensemble
Users that are interested in lshensemble are comparing it to the libraries listed below
Sorting:
- Code and Benchmarks for JOSIE (SIGMOD 2019)☆19Updated 2 years ago
- Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)☆107Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 2 months ago
- Efficient set similarity search algorithms implemented in Go☆33Updated 2 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆117Updated last year
- A Jupyter notebook extension to centralize and manage data☆14Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- ☆77Updated 2 years ago
- BottomK minwise hashing for streaming set similarity☆43Updated 6 years ago
- Benchmark Datasets for Set Similarity Search☆12Updated 6 years ago
- alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.☆49Updated 4 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Search for similar short strings☆52Updated 4 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- Explaining Inference Queries with Bayesian Optimization☆10Updated 4 years ago
- Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)☆26Updated 6 years ago
- Python bindings for the fast integer compression library FastPFor.☆58Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆153Updated 10 months ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 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
- MonetDB as a shared library with a C API☆33Updated 3 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆10Updated 7 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 4 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- Your worst case is our best case.☆137Updated 8 years ago
- Minhash LSH in Golang☆25Updated 5 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago