Do We Still Have to Denormalize? Have Your Schema and Search It Too

Stu Hood headshot

By Stu Hood on October 27, 2026

Do We Still Have to Denormalize? Have Your Schema and Search It Too

Search usually means returning results sorted by relevance (like BM25 or vector similarity), or summarizing results into facets. ParadeDB already makes this fast when your data lives in a single denormalized table.

But in a relational database, data is usually normalized and factored out into separate tables, like users, posts, and comments. We call searching across multiple joined tables a search join, and making these queries fast is harder than it looks!

Historically this pattern left people either choosing speed, and denormalizing via a fragile ETL process into Elasticsearch1, or choosing simplicity and accepting Postgres2 slowly scoring and joining millions of rows only to return a handful of results.