similarity-search-patterns

Implement similarity search patterns with Pinecone, Qdrant, pgvector, and Weaviate.

38.6k|4.1k|Updated Jul 24, 2025
One-click install
npx skills add https://github.com/wshobson/agents --skill similarity-search-patterns-wshobson
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: similarity-search-patterns
Source: https://github.com/wshobson/agents/tree/main/plugins/llm-application-dev/skills/similarity-search-patterns
Command: npx skills add https://github.com/wshobson/agents --skill similarity-search-patterns-wshobson

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires pinecone-client, qdrant-client, asyncpg, weaviate-client, numpy, sentence-transformers, and includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill provides robust patterns and templates for implementing efficient similarity search using various vector databases, crucial for modern AI applications.

Core Features & Use Cases

  • Vector Database Integration: Offers templates for Pinecone, Qdrant, pgvector, and Weaviate.
  • Search Optimization: Covers distance metrics, index types (Flat, HNSW, IVF+PQ), and hybrid search strategies.
  • Use Case: When building a RAG system, use this Skill to select the most relevant document chunks by implementing efficient vector similarity search against your knowledge base.

Quick Start

Use the similarity-search-patterns skill to implement a Pinecone vector store for semantic search.

Frequently Asked Questions about similarity-search-patterns

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I implement similarity search with pgvector or Qdrant for a RAG system?

You can implement similarity search for RAG systems using templates for vector databases like pgvector and Qdrant. These patterns help select the most relevant document chunks by executing scalable nearest neighbor queries against your knowledge base.

What is the best way to optimize vector search latency for large datasets?

The best way to optimize vector search latency is by selecting appropriate distance metrics and index types like HNSW or IVF+PQ. These indexing strategies enable efficient nearest neighbor queries for large production AI datasets.

Does this similarity search approach work with Pinecone and Weaviate?

Yes, this similarity search approach provides integration templates for both Pinecone and Weaviate. It supports building semantic search and recommendation engines across these specific vector database platforms.

How do I choose the right distance metrics and index types for vector databases?

Choosing the right distance metrics and index types depends on your specific search optimization needs. You can evaluate Flat, HNSW, and IVF+PQ index strategies to balance query speed and accuracy for your production AI systems.

Can I build hybrid search strategies combining semantic search and keyword filtering?

Yes, you can build hybrid search strategies combining semantic search with keyword filtering. The patterns cover optimizing search latency and retrieval accuracy by blending vector similarity with traditional query constraints.

When should I use HNSW vs IVF+PQ indexes for nearest neighbor queries?

Use HNSW for low-latency approximate nearest neighbor queries when memory is available, and IVF+PQ for compressing large datasets to fit memory constraints. The patterns address selecting appropriate index types based on your scalability requirements.