Claude had no problem translating SQL into Prela, and because you have fine grained control over the query plan (a Prela query is a plan), it was able to optimize queries to be very fast

▲

cpard an hour ago | parent | next [-]

I'm more curious about going from text to Prela instead of going from text to SQL and measuring any difference in the performance there. On one hand models have been trained on a lot of SQL on the other hand they are really good in mathematical reasoning too so thinking in Perla might be a natural fit for them.

	▲	remywang 20 minutes ago \| parent [-]
		There are fewer foot guns in Prela in particular no NULLs which should help both humans and robots.

▲

joelthelion an hour ago | parent | prev [-]

Having control over the execution plan is super interesting ! This is a very common frustration when writing SQL.

Do you think it would be possible to offer Prela as a direct interface to a relational database?

	▲	remywang 22 minutes ago \| parent [-]
		Yes, maybe not the language itself, but the ideas behind it. Tarski's Algebra of Relations is actually a better model for modern columns stores than the standard relational algebra, because a column is a binary relation from the primary key into its value.