Agent skill · data analytics · aiskillstore
similarity-search-patterns
Implement efficient similarity search with vector databases. Use when building semantic search, implementing nearest neighbor queries, or optimizing retrieval performance.
Why this skill is useful
Provides specific implementation patterns and code examples for efficient similarity search using vector databases, which the AI may not reliably generate on its own.
What it needs
Requires pinecone installed locally. About 6k tokens when loaded. Last updated 2026-08-07. 405 stars on the source repository.
What this skill does
Similarity Search Patterns Patterns for implementing efficient similarity search in production systems. When to Use This Skill Building semantic search systems Implementing RAG retrieval Creating recommendation engines Optimizing search latency Scaling to millions of vectors Combining semantic and keyword search Core Concepts 1. Distance Metrics Metric Formula Best For -------- --------- ---------- Cosine 1 - (A·B)/(‖A‖‖B‖) Normalized embeddings Euclidean (L2) √Σ(a-b)² Raw embeddings Dot Product A·B Magnitude matters Manhattan (L1) Σ a-b Sparse vectors 2. Index Types Templates Template 1: Pinecone Implementation Template 2: Qdrant Implementation Template 3: pgvector with PostgreSQL Template 4: Weaviate Implementation Best Practices Do's Use appropriate index - HNSW for most cases Tune parameters - efsearch, nprobe for recall/speed Implement hybrid search - Combine with keyword search Monitor recall - Measure search quality Pre-filter when possible - Reduce search space Don'ts Don't skip evaluation - Measure before optimizing Don't over-index - Start with flat, scale up Don't ignore latency - P99 matters for UX Don't forget costs - Vector storage adds up Resources Pinecone Docs Qdrant Docs pgvector Weaviate Docs
How to use it
Reference it in AdaL, Claude Code, Cursor or any coding agent — nothing to install:
@skills aiskillstore/similarity-search-patterns--c6e353