PostgreSQL extension for BM25 relevance-ranked full-text search. Postgres OSS licensed.
PostgreSQL extension for BM25 relevance-ranked full-text search. Postgres OSS licensed.
Modern ranked text search for Postgres.
ORDER BY content <@> 'search terms'k1 and bpg_textsearch supports PostgreSQL 17 and 18. PostgreSQL 19 (beta) is supported on a best-effort basis while it is in beta; its CI is allowed to fail and prebuilt binaries are not published for it yet.
pg_textsearch supports PostgreSQL 17 and 18.
Download pre-built binaries from the Releases page. Available for Linux on amd64 and arm64.
cd /tmp
git clone https://github.com/timescale/pg_textsearch
cd pg_textsearch
make
make install # may need sudo
Add pg_textsearch to shared_preload_libraries in postgresql.conf, then
restart the server:
shared_preload_libraries = 'pg_textsearch' # add to existing list if needed
Enable the extension in each database:
CREATE EXTENSION pg_textsearch;
Create a table with text content
CREATE TABLE documents (
id bigserial PRIMARY KEY,
content text,
category_id integer
);
INSERT INTO documents (content, category_id) VALUES
('PostgreSQL is a powerful database system', 1),
('BM25 is an effective ranking function', 1),
('Full text search with custom scoring', 2);
Create a pg_textsearch index on the text column
CREATE INDEX docs_idx ON documents USING bm25(content) WITH (text_config='english');
Get the most relevant documents using the <@> operator
SELECT * FROM documents
ORDER BY content <@> 'database system'
LIMIT 5;
<@> returns negative BM25 scores for ascending index scans, so lower scores
rank first.
<@> can also score rows outside a BM25 index scan. This is standalone
scoring; it still uses corpus statistics from the selected BM25 index.
The index is detected from the column. Specify it explicitly when needed:
SELECT * FROM documents
ORDER BY content <@> to_bm25query('database system', 'docs_idx')
LIMIT 5;
EXPLAIN SELECT * FROM documents
ORDER BY content <@> 'database system'
LIMIT 5;
PostgreSQL may prefer standalone scoring with a sequential scan for small tables. To test the index plan:
SET enable_seqscan = off;
PostgreSQL can use a separate index to pre-filter rows before standalone scoring:
CREATE INDEX ON documents (category_id);
SELECT * FROM documents
WHERE category_id = 1
ORDER BY content <@> 'search terms'
LIMIT 10;
When PostgreSQL chooses the ordered BM25 index scan, other conditions are post-filters applied after BM25 scoring:
SELECT * FROM documents
WHERE length(content) > 100
ORDER BY content <@> 'search terms'
LIMIT 10;
Post-filtered scans automatically grow their internal scoring batch until the
LIMIT is filled, matches are exhausted, or the 100,000-result scan cap is
reached.
Create a BM25 index on a text column:
CREATE INDEX ON documents USING bm25(content) WITH (text_config='english');
| Option | Default | Description |
|---|---|---|
text_config |
required | PostgreSQL text search configuration |
k1 |
1.2 | Term frequency saturation (0.1-10.0) |
b |
0.75 | Length normalization (0.0-1.0) |
compaction |
inline | Spill-time compaction: inline, background, or off; see Background Compaction |
CREATE INDEX ON documents USING bm25(content) WITH (text_config='english', k1=1.5, b=0.8);
Index expressions for JSONB fields, multiple columns, or text transformations:
-- JSONB field extraction
CREATE INDEX events_expr_idx ON events USING bm25 ((data->>'description'))
WITH (text_config='english');
SELECT * FROM events
ORDER BY (data->>'description') <@> to_bm25query('network error', 'events_expr_idx')
LIMIT 10;
-- Text transformation
CREATE INDEX ON documents USING bm25 ((lower(content)))
WITH (text_config='simple');
-- Multi-column search
CREATE INDEX ON articles USING bm25 ((coalesce(title, '') || ' ' || coalesce(body, '')))
WITH (text_config='english');
The expression must evaluate to text and use only IMMUTABLE functions.
Queries must repeat the same expression in the ORDER BY clause.
Add a WHERE clause to index a subset of rows:
CREATE INDEX documents_category_bm25_idx ON documents USING bm25 (content)
WITH (text_config='english')
WHERE category_id = 1;
SELECT * FROM documents
WHERE category_id = 1
ORDER BY content <@> to_bm25query('search terms', 'documents_category_bm25_idx')
LIMIT 10;
Partial indexes require explicit index naming via to_bm25query() — the
implicit text <@> 'query' syntax skips them.
Create one partial index per language:
ALTER TABLE documents ADD COLUMN lang CHAR(2) NOT NULL DEFAULT 'en';
CREATE INDEX docs_en_idx ON documents USING bm25 (content)
WITH (text_config='english') WHERE lang = 'en';
CREATE INDEX docs_de_idx ON documents USING bm25 (content)
WITH (text_config='german') WHERE lang = 'de';
CREATE INDEX docs_fr_idx ON documents USING bm25 (content)
WITH (text_config='french') WHERE lang = 'fr';
Query with the matching predicate and index name:
SELECT * FROM documents
WHERE lang = 'en'
ORDER BY content <@> to_bm25query('databases', 'docs_en_idx')
LIMIT 10;
Use a Chinese-aware PostgreSQL text search configuration such as
zhparser. The same text_config tokenizes
documents and queries.
CREATE EXTENSION zhparser;
CREATE TEXT SEARCH CONFIGURATION public.chinese (PARSER = zhparser);
ALTER TEXT SEARCH CONFIGURATION public.chinese
ADD MAPPING FOR n, v, a, i, e, l WITH simple;
CREATE TABLE chinese_documents (id bigserial PRIMARY KEY, content text);
INSERT INTO chinese_documents (content) VALUES ('机器学习');
CREATE INDEX chinese_documents_bm25 ON chinese_documents USING bm25 (content)
WITH (text_config='public.chinese');
SELECT id FROM chinese_documents
ORDER BY content <@> to_bm25query('机器学习', 'chinese_documents_bm25')
LIMIT 10;
bm25query can carry an explicit index name:
SELECT to_bm25query('search query text', 'docs_idx');
SELECT 'docs_idx:search query text'::bm25query;
Explicit index names are required when the planner cannot infer an index,
including partial indexes, PL/pgSQL, prepared or dynamic query text, and
ambiguous expressions. Standalone scoring requires SELECT on the indexed
table or columns.
| Function | Description |
|---|---|
| to_bm25query(text) → bm25query | Create bm25query without explicit index context |
| to_bm25query(text, text) → bm25query | Create bm25query with query text and index name |
| text <@> bm25query → double precision | BM25 scoring operator (returns negative scores) |
| bm25query = bm25query → boolean | Equality comparison |
For initial loads, create the index after loading data.
PostgreSQL uses parallel workers automatically for sufficiently large tables.
SET max_parallel_maintenance_workers = 4;
SET maintenance_work_mem = '256MB';
Each parallel worker receives at least a 64MB internal build budget, so size memory for the worker count. Partitioned tables build each partition separately.
When PostgreSQL chooses a BM25 index scan for ORDER BY, scoring uses
Block-Max WAND.
LIMIT n requests the top-k result count. For filtered queries, selectivity
seeding may start with a deeper internal scoring batch. Without a pushed-down
SQL LIMIT, pg_textsearch.default_limit sets the initial scoring batch,
which can grow as more rows are requested.
SELECT * FROM documents ORDER BY content <@> 'search terms' LIMIT 10;
Segment compression is enabled by default. Disable it only when decompression is a measured bottleneck:
SET pg_textsearch.compress_segments = off;
Update-heavy workloads can fragment index pages. Use REINDEX during a
low-traffic window if cold-cache latency degrades:
REINDEX INDEX docs_idx;
With the default inline policy, compaction of levels that reach the configured
threshold occurs as part of the write transaction that triggers the spill.
These functions provide manual and scheduled control:
SELECT bm25_force_merge('docs_idx');
SELECT bm25_compact('docs_idx'::regclass);
SELECT bm25_compact_step('docs_idx'::regclass);
SELECT bm25_needs_compaction('docs_idx'::regclass);
SELECT bm25_level_counts('docs_idx'::regclass);
bm25_force_merge() runs one bounded best-effort pass over eligible adjacent
segments; oversized or otherwise uncombinable segments may remain.
bm25_compact() processes all eligible levels, while bm25_compact_step()
processes at most one pass.
ROLLBACK.bm25_compact_step()'s return value, not
bm25_needs_compaction(), which is advisory.See ARCHITECTURE.md for sizing, publication, locking, and page-reclaim details.
Hot standbys serving queries must set hot_standby_feedback = on so active
snapshots delay physical page reuse on the primary.
| Setting | Default | Description |
|---|---|---|
pg_textsearch.default_limit |
1000 | Initial scoring batch when no SQL LIMIT is available |
pg_textsearch.compress_segments |
on | Compress posting blocks in new segments |
pg_textsearch.segments_per_level |
8 | Segments per level before automatic compaction (2-64) |
pg_textsearch.max_segment_size |
4095MB | Conservative size budget for newly merged multi-source segments (1-4095MB) |
pg_textsearch.compaction_request_function |
(empty) | Schema-qualified name of a function taking one regclass, invoked for indexes set to compaction = 'background' |
pg_textsearch.bulk_load_threshold |
100000 | Terms per transaction before auto-spill (0 = disable) |
pg_textsearch.memtable_pages_threshold |
64 | Chain pages before auto-spill (0 = disable) |
pg_textsearch.allow_rls |
on | Allow BM25 indexes on RLS-protected tables; superuser-only |
pg_textsearch.memtable_cache_enabled |
on | Cache memtable data in shared memory for faster queries |
pg_textsearch.memory_limit |
2GB | Approximate shared-memory budget for the memtable cache across all indexes; changes take effect after a configuration reload without a restart (0 = no limit) |
The L0 memtable is stored in the index as a WAL-logged chain of pages. It is
the durable source of truth and can be restored by PostgreSQL without loading
pg_textsearch.so. See ARCHITECTURE.md.
Queries use a shared-memory cache when enabled. An index falls back to the
chain when the next record's estimated growth would cross
memory_limit / 8; global pressure triggers best-effort eviction at
memory_limit / 2. The global memory_limit is an approximate admission
threshold: incremental catch-up and cold builds fall back when the entry-time
estimate is already at the limit, but admitted or concurrent work may take
estimated usage above it. The cache is rebuilt from the chain when missing or
stale, while standbys always read the chain directly.
Memtables spill automatically based on
No open issues yet, or sync has not completed.