What problem does it solve? Vector databases become slow and memory-hungry as they scale to hundreds of thousands or millions of embeddings, causing high search latency and excessive RAM usage. This Skill provides concrete configuration recipes to reduce memory by 4-32x and accelerate search by up to 12,500x in AgentDB. ## Core Features & Use Cases - Quantization Strategies: Apply binary (32x), scalar (4x), or product (8-16x) quantization to shrink vector storage with documented accuracy trade-offs. - HNSW Index Tuning: Configure M, efConstruction, and efSearch parameters for logarithmic-time similarity search at any dataset scale. - Caching & Batch Operations: Use in-memory LRU pattern caches and batch inserts to cut retrieval latency below 1ms and insert 100 vectors in 2ms. - Use Case: A developer deploying a RAG application on a memory-constrained edge device applies binary quantization and a small cache to store 100K vectors in roughly 10MB while keeping search under 100µs. ## Quick Start Ask the AI to configure an AgentDB adapter with binary quantization, a 1000-entry cache, and HNSW indexing for your existing vector database.