‹ BackHN Continuity

Thread

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

702 points · 144 comments · polyphilz

  1. hamilyon2 · · focus · HN ↗
    Optimal plan construction is math-heavy, algorithm-heavy and vary even by workload. There are options like creating just-in-time indexes, so solution space grows even faster than article presents. Sometimes it is the query planner which is the slow part of total execution time.

    LLM is kind of blunt weapon to use here. I am waiting rather for alphago style neural net heuristic.

    1. kccqzy · · focus · HN ↗
      It’s ultimately based on a lot of hand-written heuristics. Google has some non-LLM based machine learning technique to guide optimization heuristics in LLVM; that would be closer to what you are looking for.
      1. dnautics · · focus · HN ↗
        I think your CPU might even have a small neural net in the branch predictor
Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.