awesome-vector-database
github.com/dangkhoasdc/awesome-vector-database ↗A curated list of awesome works related to high dimensional structure/vector search & database
353
GitHub Stars
298
Curated Resources
15
Categories
4 hours ago
Last Refreshed
ComparisonsMultidimensional data / VectorsTextsOthersCoursesSurveyQuantizationGraph-based Methods🎄Tree-based MethodsHashingOther ApproachesSystems:chart_with_upwards_trend: Evaluation & Metrics📰 Articles & TalksRelated Lists
Use this list with your AI agent
Add the Context Awesome MCP server to Claude, Cursor, or any MCP client, then ask:
"Show me others resources from awesome-vector-database"
Installation instructions →What's inside
Others
Graph-based Methods
- ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data
- An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint
- An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval
- BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU.
- Breaking the Storage-Compute Bottleneck in Billion-Scale ANNS: A GPU-Driven Asynchronous I/O Framework.
- Cagra: Highly parallel graph construction and approximate nearest neighbor search for gpus.
Quantization
- Adanns: A framework for adaptive semantic search
- A real-time adaptive multi-stream gpu system for online approximate nearest neighborhood search.
- BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector.
- Cracking Vector Search Indexes
- CS-PQ: Cache-Friendly SIMD Product Quantization for Large-Scale ANNS Index Construction.
- Curator: Efficient Vector Search with Low-Selectivity Filters.
🎄Tree-based Methods
- AiSAQ: All-in-Storage ANNS with Product Quantization for DRAM-free Information Retrieval
- Approximate Nearest Neighbor Search with Window Filters
- Constructing Tree-based Index for Efficient and Effective Dense Retrieval.
- Diskann: Fast accurate billion-point nearest neighbor search on a single node.
- Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search.
- GTS: GPU-based Tree Index for Fast Similarity Search
Multidimensional data / Vectors
Survey
Hashing
- Awesome Papers on Learning to Hash
- Binary code based hash embedding for web-scale applications
- Binary Embedding-based Retrieval at Tencent
- DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
- Efficient locality sensitive hashing: solutions, primitives, and applications.
- Fast Search on Binary Codes by Weighted Hamming Distance
Showing a sample of 298 resources. View the full list on GitHub →