Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector indexes, using modern embedding datasets.
☆58Aug 31, 2026Updated this week
Alternatives and similar repositories for vibe
Users that are interested in vibe are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- [NeurIPS'24] Approximate Nearest Neighbor search using reduced-rank regression, with extremely fast queries, tiny memory usage, and rapid…☆52Aug 23, 2026Updated last week
- [ICML'26] LEMUR reduces multi-vector retrieval for late interaction models such as ColBERT into regular single-vector retrieval.☆33Aug 23, 2026Updated last week
- [SIGMOD'26] Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search☆19Nov 9, 2025Updated 9 months ago
- ⚡ Super fast clustering for high-dimensional vectors on CPUs (x86, ARM) and GPUs — for Python and C++. Faster clustering of vector embedd…☆82Updated this week
- A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of yo…☆21May 6, 2026Updated 3 months ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Public repository for CleANN, an efficient fully-dynamic approximate nearest neighbor search index☆16Sep 18, 2025Updated 11 months ago
- A list of multi-vector retrieval resources☆18May 29, 2024Updated 2 years ago
- Distance Computaion for Vector Databases☆13Sep 7, 2025Updated 11 months ago
- Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++☆30Feb 25, 2017Updated 9 years ago
- [SIGMOD2026] Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search with Task-Centric Benchmarks☆27Dec 31, 2025Updated 8 months ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆62Sep 16, 2024Updated last year
- ☆31Apr 22, 2026Updated 4 months ago
- High-Performance K-Means Clustering Library☆41Jul 6, 2025Updated last year
- C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search☆26Jul 29, 2024Updated 2 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Reducing Dimensionality method for Nearest Neighbor Search☆15Nov 12, 2020Updated 5 years ago
- An Experimental Evaluation of the State-of-the-Art Graph-Based Vector Search Methods and Techniques☆23Jun 3, 2025Updated last year
- Benchmark for filtered ANN search applications☆28Apr 28, 2026Updated 4 months ago
- ☆19May 16, 2024Updated 2 years ago
- ☆15Apr 19, 2026Updated 4 months ago
- An official lightweight library for the RaBitQ algorithm and its applications in vector search.☆270Updated this week
- ☆17Nov 11, 2025Updated 9 months ago
- A fast multi-core implementation of the PLSCAN clustering algorithm.☆23Aug 10, 2026Updated 3 weeks ago
- [SIGMOD 2026] DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search.☆29Aug 19, 2025Updated last year
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Ada-ef (SIGMOD '26) — Adaptive efSearch for HNSW-based vector search☆19Jun 19, 2026Updated 2 months ago
- Query-Adaptive Vector Search☆77Mar 19, 2026Updated 5 months ago
- ☆20Feb 25, 2026Updated 6 months ago
- The repo has been moved to https://github.com/VectorDB-NTU/RaBitQ-Library. [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with…☆253Apr 22, 2026Updated 4 months ago
- ☆13Nov 15, 2017Updated 8 years ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆65Jan 22, 2025Updated last year
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆81May 16, 2021Updated 5 years ago
- Page of the course "Information Retrieval" at Department of Computer Science, University of Pisa☆21Dec 18, 2025Updated 8 months ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆448Jul 13, 2026Updated last month
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Cost-aware Bayesian optimization via the Pandora's box Gittins index☆13Aug 8, 2025Updated last year
- Graph Library for Approximate Similarity Search☆146Sep 9, 2025Updated 11 months ago
- Algorithms for approximate nearest neighbor search with window filters☆47Feb 5, 2024Updated 2 years ago
- XTR/WARP (SIGIR'25) is an extremely fast and accurate retrieval engine based on Stanford's ColBERTv2/PLAID and Google DeepMind's XTR.☆216May 3, 2025Updated last year
- ☆24Apr 4, 2024Updated 2 years ago
- Exploration of Vector database Index for fast approximate nearest neighbour search.☆41Aug 4, 2024Updated 2 years ago
- ☆20Jun 23, 2024Updated 2 years ago