Story

On air. The free wire runs 15 minutes behind live. See pricing

World, crypto, finance and tech news, scored for impact.

TechHacker NewsFiled 40 h ago

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

Open the sourceReported by Hacker News, paradedb.com, 13 November 2026

Not investment advice. Muhabbit scores how much a story may matter, not which way to trade.

ParadeDB released a search-join capability that lets Postgres run multi-table relevance queries without denormalizing data into a separate search engine, claiming up to 1,000x speedups over vanilla Postgres on a StackOverflow benchmark that spans 2.3 million users, 20 million posts, 29 million comments and 29.4 million badges. The company said a natural three-table Top-K search dropped from roughly two minutes to 100 milliseconds, with no additional infrastructure required. The feature targets the long-standing tradeoff between fast search via fragile ETL pipelines into systems like Elasticsearch and simpler but slow scoring and joining of millions of rows inside Postgres. ParadeDB argues that denormalized copies carry steep costs, including double writes and up to 3x storage after replication, worsened by power-law skew. The company is positioning search joins as a first-class Postgres experience; next, watch adoption among teams currently maintaining dual database architectures and whether independent benchmarks confirm the claimed latency gains.

Muhabbit's AI wrote this summary in its own words from Hacker News's report. It can get details wrong, so check the source.

Named in this story

ParadeDB, Postgres, Elasticsearch, StackOverflow