Nov 8, 2026 · 17 min · 12 segments
In this episode of Scaling Postgres, we discuss the public beta of Oriole DB, 100,000 times faster queries with GPUs, post pg\_restore to-do and a lesson in data integrity. To get the show notes as…
Creston JamisonHost
Our first piece of content is Programming at Lightspeed, Building the Gravity Query Engine.

Their 0.4 beta that was just released has a new query engine they're calling Gravity, and they say it is three times faster than ClickHouse on ClickBench.

and it achieves that speed, quote, while supporting the full PostgreSQL dialect and type system.

And he's talked about this previously, but they have been using batching, operator fusion, and SMID to make PGRust hundreds of times faster than Postgres for analytical queries.

And they're considering this a query compiler that generates optimal machine code for any SQL query.

And he says normally when engineers work to make something faster, they work what he's calling from the bottom up.

How can we make it faster? Can we make it 20% faster, 40% faster, whatever? The problem is you don't know how far away the limits of your machine are.

They asked, how fast could it actually be? So basically, they started from the physical speed limit of their hardware and file format and worked backwards from there.

So to program at light speed, he had Claude write a Optimize Rust program against their columnar storage crates.

So there was no SQL executor, it just ran hand-tuned multi-threaded Rust loops with SMID directly over there on this format.

And this, pedal to the metal as it were, executed queries four times faster than existing analytical databases like ClickHouse.

So they said with this metric, they want to write Gravity, their query engine, to be within 20% of this Rust code execution.

And they developed Gravity as a multi-stage compiler pipeline that progressively lowers a high-level Postgres plan down to raw assembly.

So it does eventually make the Postgres plan, but then it goes into a pipeline graph and then a Lisp IR that gets compiled into assembly.

Now this goes into a lot of detail I can't cover in the show, but definitely check this blog post out if you want all the detail.

They did say that as they were testing different queries, they noticed there were instances where they could not reach, you know, their light speed metric.

And they basically found algorithms they needed to add to the planner specifically for their columnar format, which is why the stock Postgres planner couldn't support them.

And the result is what was basically said in the headlines is that their execution runs as much as three times faster than ClickHouse.

Our first piece of content is Programming at Lightspeed, Building the Gravity Query Engine.

Their 0.4 beta that was just released has a new query engine they're calling Gravity, and they say it is three times faster than ClickHouse on ClickBench.

and it achieves that speed, quote, while supporting the full PostgreSQL dialect and type system.

And he's talked about this previously, but they have been using batching, operator fusion, and SMID to make PGRust hundreds of times faster than Postgres for analytical queries.

And they're considering this a query compiler that generates optimal machine code for any SQL query.

And he says normally when engineers work to make something faster, they work what he's calling from the bottom up.

How can we make it faster? Can we make it 20% faster, 40% faster, whatever? The problem is you don't know how far away the limits of your machine are.

They asked, how fast could it actually be? So basically, they started from the physical speed limit of their hardware and file format and worked backwards from there.

So to program at light speed, he had Claude write a Optimize Rust program against their columnar storage crates.

So there was no SQL executor, it just ran hand-tuned multi-threaded Rust loops with SMID directly over there on this format.

And this, pedal to the metal as it were, executed queries four times faster than existing analytical databases like ClickHouse.

So they said with this metric, they want to write Gravity, their query engine, to be within 20% of this Rust code execution.

And they developed Gravity as a multi-stage compiler pipeline that progressively lowers a high-level Postgres plan down to raw assembly.

So it does eventually make the Postgres plan, but then it goes into a pipeline graph and then a Lisp IR that gets compiled into assembly.

Now this goes into a lot of detail I can't cover in the show, but definitely check this blog post out if you want all the detail.

They did say that as they were testing different queries, they noticed there were instances where they could not reach, you know, their light speed metric.

And they basically found algorithms they needed to add to the planner specifically for their columnar format, which is why the stock Postgres planner couldn't support them.

And the result is what was basically said in the headlines is that their execution runs as much as three times faster than ClickHouse.
The rest of this transcript — segmented and speaker-labeled, so you land on the exact moment something was said
Search every transcript — by keyword, by phrase, or by meaning, across every show Radar indexes
Trends — what is surging across podcasts, measured against its own baseline
Alerts — when a name you follow appears in a newly indexed episode
No account is needed to search Radar.