ParadeDB makes a 3-table search join 1000x faster than vanilla Postgres, no denormalization needed
Do we still have to denormalize? Have your schema and search it too

ParadeDB's new Rank Join executes natural multi-table search queries directly in Postgres, cutting a three-table Top-K search from 2 minutes to 100 ms on a single core. By pushing joins into a columnar DataFusion executor with selective late materialization, it avoids the ETL and storage bloat of denormalizing into Elasticsearch, while keeping your schema normalized.
Getting that original, natural SQL query down to 100 ms on a single core required rethinking how joins and search indexes interact.