| ▲ | Asm2D 4 hours ago | |
Many SQL engines have JIT compilers. The problems related to PostgreSQL are pretty much all described here. It's very difficult to do low-latency queries if you cannot cache the compiled code and do it over and over again. And once your JIT is slow you need a logic to decide whether to interpret or compile. I think it would be the best to start interpreting the query and start compilation in another thread, and once the compilation is finished and interpreter still running, stop the interpreter and run the JIT compiled code. This would give you the best latency, because there would be no waiting for JIT compiler. | ||
| ▲ | aengelke 4 hours ago | parent | next [-] | |
> It's very difficult to do low-latency queries if you cannot cache the compiled code This is not too difficult, it just requires a different execution style. Salesforce's Hyper for example very heavily relies on JIT compilation, as does Umbra [1], which some people regard as one of the fastest databases right now. Umbra doesn't cache any IR or compiled code and still has an extremely low start-up latency; an interpreter exists but is practically never used. Postgres is very robust and very powerful, but simply not designed for fast execution of queries. Disclosure: I work in the group that develops Umbra. | ||
| ▲ | chrisaycock 4 hours ago | parent | prev [-] | |
> I think it would be the best to start interpreting the query and start compilation in another thread This technique is known as a "tiered JIT". It's how production virtual machines operate for high-level languages like JavaScript. There can be many tiers, like an interpreter, baseline compiler, optimizing compiler, etc. The runtime switches into the faster tier once it becomes ready. More info for the interested: | ||