postgres-semantic-search

v2026.09.24

PostgreSQL-based semantic and hybrid search with pgvector and ParadeDB. Use when implementing vector search, semantic search, hybrid search, or full-text search in PostgreSQL. Covers pgvector indexing, hybrid FTS/BM25 + RRF, ParadeDB, reranking, halfvec, multilingual search, query translation, and domain evals. Triggers: pgvector, vector search, semantic search, hybrid search, embedding search, PostgreSQL RAG, BM25, RRF, HNSW, IVFFlat, ParadeDB, pg_search, reranking, iterative_scan, filtered HNSW, halfvec, websearch_to_tsquery, unaccent, multilingual FTS, pg_trgm, trigram, fuzzy search, ILIKE, autocomplete, typo tolerance, fuzzystrmatch, Hit@K, MRR, retrieval evals, cross-lingual retrieval, non-English corpus, per-language indexing, query translation For general Postgres schema, index, RLS or query tuning unrelated to retrieval, use supabase-postgres-best-practices instead.

GitHub
安装命令
npx skhub add laguagu/postgres-semantic-search
Markdown
SKILL.md

PostgreSQL Semantic Search

Quick Start

1. Setup

CREATE EXTENSION IF NOT EXISTS vector;

CREATE TABLE documents (
    id SERIAL PRIMARY KEY,
    content TEXT NOT NULL,
    embedding vector(1536)  -- 1536-dim embedding
    -- Or: embedding halfvec(3072)  -- 3072-dim embedding (halfvec = 50% memory)
);

2. Basic Semantic Search

SELECT id, content, 1 - (embedding <=> query_vec) AS similarity
FROM documents
ORDER BY embedding <=> query_vec
LIMIT 10;

3. Add an approximate index when measured latency requires it

CREATE INDEX ON documents USING hnsw (embedding vector_cosine_ops);

Docker Quick Start

# pgvector with PostgreSQL 17
docker run -d --name pgvector-db \
  -e POSTGRES_PASSWORD=postgres \
  -p 5432:5432 \
  pgvector/pgvector:pg17

# Or PostgreSQL 18
docker run -d --name pgvector-db \
  -e POSTGRES_PASSWORD=postgres \
  -p 5432:5432 \
  pgvector/pgvector:pg18

# ParadeDB (includes pgvector + pg_search + BM25)
docker run -d --name paradedb \
  -e POSTGRES_PASSWORD=postgres \
  -p 5432:5432 \
  paradedb/paradedb:latest  # `latest` is convenient for quick-start; pin a tested release or image digest for reproducible builds

Connect: psql postgresql://postgres:postgres@localhost:5432/postgres

Cheat Sheet

Common Queries

-- Top 10 similar (cosine)
SELECT * FROM docs ORDER BY embedding <=> $1 LIMIT 10;

-- With similarity score
SELECT *, 1 - (embedding <=> $1) AS similarity FROM docs ORDER BY embedding <=> $1 LIMIT 10;

-- With iterative scans, pgvector recommends an outer distance filter for
-- executor performance. The threshold can legitimately return fewer than 10 rows.

WITH nearest AS MATERIALIZED (
  SELECT id, content, embedding <=> $1 AS distance FROM docs
  ORDER BY distance LIMIT 10
) SELECT * FROM nearest WHERE distance < 0.3 ORDER BY distance;

-- Optional warm-up query; touches only the pages visited, not the full index
SELECT 1 FROM docs ORDER BY embedding <=> $1 LIMIT 1;

Index Quick Reference

-- HNSW (recommended)
CREATE INDEX ON docs USING hnsw (embedding vector_cosine_ops);

-- With tuning
CREATE INDEX ON docs USING hnsw (embedding vector_cosine_ops)
WITH (m = 24, ef_construction = 200);

-- Tune ef_search against exact search on representative queries.
-- Higher values trade query latency for recall; 100 is an example, not a target.

-- Query-time settings are connection-local. Use SET LOCAL inside a transaction
-- when a transaction pooler can hand each request a different connection.
SET hnsw.ef_search = 100;

-- Iterative scan for filtered queries (pgvector 0.8+; OFF by default)
SET hnsw.iterative_scan = relaxed_order;    -- or strict_order
SET ivfflat.iterative_scan = relaxed_order; -- IVFFlat has no strict_order

Decision Trees

Choose Search Method

Query type?
├─ Conceptual/meaning-based → Pure vector search
├─ Exact terms/names → Pure keyword search (FTS)
├─ Fuzzy/typo-tolerant → pg_trgm trigram similarity
├─ Autocomplete/prefix → pg_trgm + prefix index
├─ Substring (LIKE/ILIKE) → pg_trgm GIN index
└─ Mixed/unknown → Hybrid search
    ├─ Simple setup → FTS + RRF (pgvector; no BM25 extension)
    ├─ Better ranking → BM25 + RRF (pg_search extension)
    └─ Full-featured → ParadeDB (Elasticsearch alternative)

Benchmark vector-only, keyword-only and hybrid on representative queries, including exact identifiers. Select HNSW or IVFFlat from recall, latency, build cost and memory measurements; there is no universal document-count cutoff. HNSW usually has a better speed/recall tradeoff but higher memory and build cost. Keep exact search as the recall baseline.

Choose Vector Type

Choose by dimensions, not by provider — the column type only depends on embedding size and pgvector's HNSW index limits.

Embedding dimensions (N)?
├─ N ≤ 2000  → vector(N)   — HNSW indexable directly
├─ 2000 < N ≤ 4000 → halfvec(N) — vector(N)'s HNSW limit is 2000; halfvec extends to 4000
└─ N > 4000  → vector(N) without HNSW, or quantize via dimensionality reduction

Common embedding dimensions are 1536 and 3072, but sizes vary by provider and model — check the provider's docs for the embedding you're using.

For multilingual / non-English content, prefer multilingual-tuned embedding models (verify language coverage and evaluate on the target languages). Models tuned only on English may handle compound words and inflection poorly.

Storage vs. index trick for 2000 < N ≤ 4000: keep the column as vector(N) (full float4, useful for future re-embedding or re-ranking experiments) and only cast at index creation and query time. This preserves precision on disk while staying within HNSW's dimension limit.

CREATE INDEX ON docs USING hnsw ((embedding::halfvec(3072)) halfvec_cosine_ops);
-- Query must cast identically so the planner picks the index:
SELECT * FROM docs ORDER BY embedding::halfvec(3072) <=> $1 LIMIT 10;

If storage is tight or you never plan to re-embed, use halfvec(N) as the column type directly.

Measure before adopting

Build a domain eval set (evaluation.md) with both natural-language questions and short domain terms. A/B retrieval, reranking, translation and model changes against it. Measure end-to-end answer grounding when an LLM consumes results; retrieval gains alone need not improve answers. Choose acceptance thresholds and p95 latency/cost budgets for the product, accounting for dataset size and run-to-run variance.

Operators

OperatorDistanceUse Case
<=>CosineText embeddings (default)
<->L2/EuclideanImage embeddings
<#>Negative inner productAlready-normalized vectors. Negative so that ORDER BY ascending still puts the closest first — negate it to read as a score
<+>L1 / taxicab (vector_l1_ops, HNSW only)Outlier-heavy features; vector, halfvec, sparsevec
<~>Hamming (bit_hamming_ops)Binary embeddings stored as bit(n) — compact and fast, coarser recall
<%>Jaccard (bit_jaccard_ops, HNSW only)Set-style binary embeddings as bit(n)

SQL Functions

These are defined by this skill, not by pgvector. Install them by running the matching file from scripts/ — match_documents does not exist in a database that has not had semantic_search.sql applied. Parameter names below are the real ones from the scripts — Supabase .rpc() binds by name, so a misspelled key fails at call time.

Semantic Search — scripts/semantic_search.sql

  • match_documents(query_embedding, match_threshold, match_count) - Basic search
  • match_documents_filtered(query_embedding, filter_metadata, match_threshold, match_count) - With JSONB filter
  • match_documents_halfvec(query_embedding halfvec(3072), match_threshold, match_count) - halfvec column variant
  • match_documents_dynamic(table_name, query_embedding, match_threshold, match_count) - Same search against any table name
  • match_chunks(query_embedding, match_threshold, match_count) - Search document chunks

Fuzzy Search (pg_trgm) — scripts/fuzzy_search.sql

  • fuzzy_search_trigram(query_text, similarity_threshold, max_results) - Trigram similarity search
  • autocomplete_search(search_prefix, max_results) - Prefix + fuzzy autocomplete
  • hybrid_search_fuzzy_semantic(query_text, query_embedding, max_results, rrf_k) - Fuzzy + vector RRF
  • weighted_fts_search(query_text, fts_language, max_results) - FTS with title/content weighting

Hybrid Search (FTS) — scripts/hybrid_search_fts.sql

  • hybrid_search_fts(query_embedding, query_text, match_count, rrf_k, fts_language) - FTS + RRF
  • hybrid_search_weighted(query_embedding, query_text, match_count, semantic_weight, keyword_weight, fts_language) - Linear combination
  • hybrid_search_fallback(query_embedding, query_text, match_count, rrf_k, fts_language) - Graceful degradation (either input may be NULL)

These functions do not set hnsw.ef_search; the caller controls that query-time tradeoff. Set it on the active connection (or with SET LOCAL in the same transaction) before calling, or pgvector's default of 40 applies. Their keyword arm also wraps content in unaccent() and computes the tsvector per row; read the header of hybrid_search_fts.sql before using them on Finnish, Swedish, German or Turkish text, or on a table that has a tsvector GIN index.

Hybrid Search (BM25) — scripts/hybrid_search_bm25.sql

  • hybrid_search_bm25(query_embedding, query_text, match_count, rrf_k) - BM25 + RRF
  • hybrid_search_bm25_highlighted(query_embedding, query_text, match_count, rrf_k) - With snippet highlighting
  • hybrid_search_chunks_bm25(query_embedding, query_text, match_count, rrf_k) - For RAG with chunks

Re-ranking (Optional)

Two-stage retrieval improves precision: fast recall → precise rerank with a cross-encoder. Use when results need higher precision and you have <50 candidates after initial retrieval.

Key rule: rerankers must be wrapped so a failure (missing key, HTTP error, timeout) returns null and the caller falls back to original retrieval order — never let a reranker outage break search.

For provider comparison, generic Promise<T | null> wrapper, and self-hosted options, see reranking.md.

Multilingual / non-English content

Non-English corpora fail in specific, silent ways: the wrong FTS config skips stemming, unaccent merges distinct Finnish/Swedish/German words, zero-width characters glue onto tokens, every parser ANDs a long question into zero hits, and English-derived chunk caps overflow the embedding endpoint. The rules and fixes — FTS configs, prefix tsquery, synonym expansion, query translation, ParadeDB stemmer casts, per-language indexing, cross-language RRF fusion — are in multilingual.md. Read it before indexing anything that is not English prose.

References

  • fuzzy-search.md - pg_trgm, fuzzy matching, LIKE/ILIKE, autocomplete, advanced FTS
  • paradedb.md - ParadeDB full-text search (Elasticsearch alternative)
  • vector-types.md - vector vs halfvec, dimensions, storage
  • indexing.md - HNSW, IVFFlat, GIN parameters
  • hybrid-search.md - FTS, BM25, RRF algorithms
  • performance.md - Cold-start, memory, HNSW vs IVFFlat
  • evaluation.md - Eval-set construction, Hit@K / MRR, adoption thresholds, reranker/expansion benchmarking
  • reranking.md - Two-stage retrieval, graceful fallback, when rerankers regress
  • multilingual.md - FTS configs and unaccent rules, invisible characters, prefix tsquery, query translation, per-language indexing, cross-language RRF

Scripts

Common Patterns

TypeScript Integration (Supabase)

// Semantic search
const { data } = await supabase.rpc('match_documents', {
  query_embedding: embedding,
  match_threshold: 0.7,
  match_count: 10
});

// Hybrid search
const { data } = await supabase.rpc('hybrid_search_fts', {
  query_embedding: embedding,
  query_text: userQuery,
  match_count: 10,
  rrf_k: 60,
  fts_language: 'simple'
});

Drizzle ORM

import { sql } from 'drizzle-orm';

const results = await db.execute(sql`
  SELECT * FROM match_documents(
    ${embedding}::vector(1536),
    0.7,
    10
  )
`);

Troubleshooting

SymptomCauseSolution
Index not usedPlanner cost, operator/cast mismatch or query shapeInspect EXPLAIN; sequential scans can be appropriate for small tables
Slow first query (30-60s)HNSW cold-startSELECT pg_prewarm('idx_name') or preload query
Poor recallLow ef_searchSET hnsw.ef_search = 100 or higher
FTS returns nothingWrong language configUse 'simple' for mixed/unknown languages
Long plain-language question returns 0 keyword hitsParser ANDs every termFor queries without explicit OR, quotes, or -, parse with plainto_tsquery, rewrite &→|, and rank with ts_rank_cd — see hybrid-search.md
FTS misses a word that is visibly thereInvisible character (U+200B etc.) glued to the token blocks stemmingStrip zero-width characters at ingest and query time
could not determine data type of parameter $NA placeholder never appears in this variant's SQL (e.g. vector-only vs keyword-only mode sharing one numbering)Give each query variant its own statement and parameter numbering
Slow or failed index buildMemory limit or graph exceeds maintenance_work_memInspect the error and available memory; tune within the host budget, never blindly increase it
"Cosine similarity" > 1<#> used in the cosine formula1 - (a <=> b) is cosine similarity and is bounded in [-1, 1] whatever the magnitudes — <=> divides by them. <#> returns the negative inner product, unbounded: for [3,4] and [6,8] it is -50, so 1 - (a <#> b) is 51. Use <=> for cosine, or (a <#> b) * -1 for inner product on already-normalized vectors
Slow insertsIndex overheadBatch inserts, consider IVFFlat
Fuzzy search slowMissing trigram indexCREATE INDEX USING gin (col gin_trgm_ops)
ILIKE '%x%' slowNo pg_trgm GIN indexEnable pg_trgm + create GIN trigram index
% operator errorpg_trgm not installedCREATE EXTENSION IF NOT EXISTS pg_trgm

Compatibility

  • pgvector: 0.8.6+ recommended as the safe floor (as of 2026-09). Feature history: 0.7.0 added halfvec/bit/sparsevec, 0.8.0 added iterative scans. Correctness history: 0.6.0–0.8.1 carry a parallel-HNSW-build buffer overflow (CVE-2026-3172 — leaks data from other relations or crashes the server), 0.8.2 fixed it, 0.8.3 fixed possible HNSW index corruption during vacuum, 0.8.4 fixed further HNSW vacuum errors, and 0.8.6 fixed an IVFFlat build integer wraparound on 32-bit systems (CVE-2026-18022). Verify current state in the CHANGELOG — the GitHub Releases tab is empty, releases ship as tags.
  • pg_search: Since 0.25.0 pg_search depends on pgvector's vector type — install pgvector first. Check ParadeDB releases for latest.
  • PostgreSQL: pgvector supports 13+; pg_search ships prebuilt binaries for 15+. Prefer the newest major your host offers.

Related Skills

NeedSkill
General Postgres performance, indexes, RLS, connection pooling/supabase-postgres-best-practices
Chatbot orchestration, session DB, tool calls, HITL, feedback/nextjs-chatbot
AI SDK usage for embeddings and retrieval/ai-sdk

For ParadeDB-specific questions, always apply the Documentation Fetch Policy in references/paradedb.md — live docs at https://www.paradedb.com/docs/llms-full.txt are the authoritative source.

External Documentation

Core

Embedding providers

Reranker providers

Hosting / extensions

发现
标签

此技能尚未发布标签。

版本
最新版本元数据

版本

v2026.09.24

发布时间

Sep 24, 2026

分类

未分类

许可证

MIT

源路径

skills/postgres-semantic-search

默认分支

main

最新提交

024a224

Tree SHA

4eb54d7