This article explains how inverted indexes power full-text search in databases like Postgres. Unlike b-trees that work on entire column values, inverted indexes map individual words to document locations, enabling efficient searches for terms anywhere in text fields. The index consists of a term dictionary and postings lists that store compressed document identifiers.