‹ BackHN Continuity

Thread

Training a 4B model to produce 81% faster query plans than Postgres

702 points · 144 comments · polyphilz

  1. tancop · · focus · HN ↗
    > The goal isn’t to try and beat Postgres on the time/efficiency Pareto frontier for one-off queries, but we may be able to beat it on queries that run over and over again.

    This is the most important part. Most queries are either quick transactions that can run thousands of times per second, or complex but predictable scheduled analytics.

    One off queries are pretty rare and optimizing for them instead of the common ones is a massive own goal almost every database is repeating. I don't think you need a LLM to beat Postgres.

Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.