ekzhu / lshensembleLinks
LSH index for approximate set containment search
☆61Updated 3 years ago
Alternatives and similar repositories for lshensemble
Users that are interested in lshensemble are comparing it to the libraries listed below
Sorting:
- Weighted MinHash implementation on CUDA (multi-gpu).☆121Updated 2 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 9 months ago
- Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)☆107Updated 7 years ago
- Efficient set similarity search algorithms implemented in Go☆35Updated 3 years ago
- Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)☆27Updated last month
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Python bindings for the fast integer compression library FastPFor.☆61Updated 2 years ago
- BottomK minwise hashing for streaming set similarity☆44Updated 6 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆306Updated 7 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆131Updated 2 years ago
- Python bindings to Succinct Data Structure Library 2.0☆34Updated 6 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- A C++ library providing fast language model queries in compressed space.☆132Updated 2 years ago
- Search for similar short strings☆53Updated 5 years ago
- An implementation of efficient LSH inspired by fruit fly brain☆87Updated 7 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆45Updated 2 years ago
- Code and Benchmarks for JOSIE (SIGMOD 2019)☆18Updated 2 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.☆49Updated 4 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 9 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated 2 years ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 8 years ago
- A simple database optimized for returning results by custom scoring functions.☆21Updated 9 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 3 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 5 years ago
- fast kernel evaluation in high dimensions via hashing☆24Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago