BlaiseMuhirwa / flatnav
A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
☆15Updated 2 weeks ago
Alternatives and similar repositories for flatnav:
Users that are interested in flatnav are comparing it to the libraries listed below
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆22Updated last year
- C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search☆22Updated 7 months ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆60Updated 5 months ago
- Official repository of kANNolo.☆26Updated 4 months ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆155Updated 3 years ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…☆56Updated 2 weeks ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Graph Library for Approximate Similarity Search☆108Updated 10 months ago
- A list of multi-vector retrieval resources☆13Updated 9 months ago
- Reducing Dimensionality method for Nearest Neighbor Search☆14Updated 4 years ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆137Updated last week
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆51Updated 4 years ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- ⚡ Faster vector search with PDX: A vertical data layout for vectors☆27Updated 2 weeks ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- ☆146Updated this week
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated this week
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆20Updated last month
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- ☆13Updated last year
- ☆70Updated 2 months ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆16Updated 5 years ago
- DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables☆15Updated last year
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- ☆12Updated 7 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 4 months ago
- A framework for index based similarity search.☆19Updated 5 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- state-of-the-art search over vector embeddings and structured data (SIGMOD '24)☆69Updated 3 weeks ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago