Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector indexes, using modern embedding datasets.
☆80Sep 23, 2026Updated last month
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…☆52Oct 6, 2026Updated 3 weeks ago
- A list of multi-vector retrieval resources☆18May 29, 2024Updated 2 years ago
- [ICML'26] LEMUR reduces multi-vector retrieval for late interaction models such as ColBERT into regular single-vector retrieval.☆33Oct 6, 2026Updated 3 weeks ago
- ☆15Oct 19, 2026Updated 2 weeks ago
- ☆11Mar 27, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆193Jul 2, 2026Updated 4 months ago
- Segmented Code Adjustment Quantization (SAQ)☆29Sep 22, 2025Updated last year
- Distance Computaion for Vector Databases☆13Sep 7, 2025Updated last year
- [SIGMOD2026] Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search with Task-Centric Benchmarks☆27Dec 31, 2025Updated 10 months ago
- Reducing Dimensionality method for Nearest Neighbor Search☆15Nov 12, 2020Updated 5 years ago
- The repo has been moved to https://github.com/VectorDB-NTU/RaBitQ-Library. [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with…☆260Apr 22, 2026Updated 6 months ago
- The repo has been moved to https://github.com/VectorDB-NTU/RaBitQ-Library. [SIGMOD 2025] Practical and Asymptotically Optimal Quantizatio…☆72Mar 30, 2026Updated 7 months ago
- Official library for RaBitQ vector quantization and approximate nearest-neighbor search, in C++ and Python.☆292Updated this week
- ⚡ Super fast clustering for high-dimensional vectors on CPUs (x86, ARM) and GPUs — for Python and C++. Faster clustering of vector embedd…☆92Oct 13, 2026Updated 3 weeks ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Official repository of TACHIOM.☆68Sep 20, 2026Updated last month
- Framework for evaluating ANNS algorithms on billion scale datasets.☆451Updated this week
- ☆13Jul 31, 2025Updated last year
- Public repository for CleANN, an efficient fully-dynamic approximate nearest neighbor search index☆19Sep 18, 2025Updated last year
- Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++☆30Feb 25, 2017Updated 9 years ago
- [SIGMOD 2026] DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search.☆32Aug 19, 2025Updated last year
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆48Jun 4, 2026Updated 4 months ago
- ☆13Jun 29, 2024Updated 2 years ago
- ☆32Apr 22, 2026Updated 6 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆67Jan 22, 2025Updated last year
- C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search☆26Jul 29, 2024Updated 2 years ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆65Sep 16, 2024Updated 2 years ago
- Query-Adaptive Vector Search☆76Mar 19, 2026Updated 7 months ago
- A Rust rewrite of FastKMeans for CPU-based clustering☆17Jun 29, 2026Updated 4 months ago
- ⚡ [WIP] DuckIR: Information Retrieval suite for DuckDB. Introduces a state-of-the-art IVF index for lightweight but fast (filtered) vecto…☆15Oct 27, 2026Updated last week
- A list of papers in the field of approximate nearest neighbor search on high-dimensional vectors.☆141Aug 11, 2026Updated 2 months ago
- Benchmark for filtered ANN search applications☆31Apr 28, 2026Updated 6 months ago
- ☆17Nov 11, 2025Updated 11 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Implementation of "RaanA: A Fast, Flexible, and Data-Efficient Post-Training Quantization Algorithm"☆18Apr 11, 2025Updated last year
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆29Oct 20, 2026Updated 2 weeks ago
- A fast multi-core implementation of the PLSCAN clustering algorithm.☆24Aug 10, 2026Updated 2 months ago
- Ada-ef (SIGMOD '26) — Adaptive efSearch for HNSW-based vector search☆20Jun 19, 2026Updated 4 months ago
- ☆13Nov 16, 2024Updated last year
- XTR/WARP (SIGIR'25) is an extremely fast and accurate retrieval engine based on Stanford's ColBERTv2/PLAID and Google DeepMind's XTR.☆223May 3, 2025Updated last year
- Algorithms for approximate nearest neighbor search with window filters☆47Feb 5, 2024Updated 2 years ago