Skip to content
Tech News
← Back to articles

UCLA researchers build toy version of new query language Prela

read original get O'Reilly "Designing Data-Intensive Applications" by Martin Kleppmann → more articles
GoKawiil Brief

Researchers at UCLA's RePL lab are developing Prela, a query language that replaces SQL's multi-column tables with simple binary relations of just two columns. A tutorial shows how a wide table, such as one listing movie IDs, titles and years, can be broken into three binary relations, each pairing a row number with a single column's value, and demonstrates a movie-search query that takes 11 lines in Prela versus more than 20 in equivalent SQL.

Why It Matters

GoKawiil's interpretation of the reporting above, not reported fact.

By reducing every table to binary relations, Prela treats data structures more like mathematical functions, which are easier to compose and reason about than SQL's rigid multi-column schemas. If the approach scales beyond toy examples, it could lead to noticeably shorter, more composable queries for complex data relationships that currently require verbose joins in SQL.

Key Takeaways
Worth a Look

O'Reilly "Designing Data-Intensive Applications" by Martin Kleppmann — If a post about reimagining SQL with binary relations sparks your curiosity, this book digs into how query engines, relational models and data systems actually work under the hood. It's the classic companion for anyone who enjoys thinking about better ways to store and query data.

See O'Reilly "Designing Data-Intensive Applications" by Martin Kleppmann on Amazon → Affiliate link — we may earn a commission on purchases, at no extra cost to you. Product picked by AI based on this article; it is not a tested recommendation.

Source: prela-lang.org, 2026-08-29

Published there as: “A better SQL in 11 lines of code”

Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.