How SEARCH can be fast (in Postgres)

Name: How SEARCH can be fast (in Postgres)
Uploaded: 2026-09-21T00:00:00.000Z
Duration: 13 min 30 s
Description: A B-tree handles message lookups by sender or recipient ID, but a contains-style search such as LIKE '%Postgres%' cannot use that sort order and falls back to scanning text. The video walks through inverted indexes: t...

Ben Dicken · 13:30 · Watch on YouTube

A B-tree handles message lookups by sender or recipient ID, but a contains-style search such as LIKE '%Postgres%' cannot use that sort order and falls back to scanning text. The video walks through inverted indexes: t...

Read the full summary on retube