this post was submitted on 24 Dec 2025
22 points (92.3% liked)

Programming

25224 readers
643 users here now

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Rules

  • Follow the programming.dev instance rules
  • Keep content related to programming in some way
  • If you're posting long videos try to add in some form of tldr for those who don't want to watch videos

Wormhole

Follow the wormhole through a path of communities !webdev@programming.dev



founded 2 years ago
MODERATORS
 

For the last year, I've been working on a query language that aims to replace SQL and data frame libraries. It's continuation of my work on PRQL and EdgeQL.

Now I need feedback on usability, ergonomics and overall design. Read trough the examples, check out the CLI & tell me what could be better.

top 8 comments
sorted by: hot top controversial new old
[–] atzanteol@sh.itjust.works 11 points 1 month ago (1 children)

Looks like an ORM? I used to use these a lot but these days I just write SQL. Far too many performance issues and fighting with a library to do what I could just write in SQL in 5 mins. Type safety doesn't really seem like a big sell here. Most SQL libs already let you "getInt()".

[–] verstra@programming.dev 1 points 1 month ago

Haven't thought about but yes - it solves a few of the same problems as ORMs. Maybe the front page does not mention it, but with Lutra, you don't get result.getInt(). You get generated Python classes / Rust structs that reflect the Lutra types.

[–] fxdave@lemmy.ml 3 points 1 month ago* (last edited 1 month ago) (1 children)

What do you think about ORMs?

[–] verstra@programming.dev 1 points 1 month ago (1 children)

I think that ORMs work great for 90% of cases, and abismally for the rest. They are also limited by the syntax and semantics of the language they are embedded in. For example, if you refer to a non-existing column, it would take a call to database to figure that out, and a cryptic error message with non-helpful code span.

[–] fxdave@lemmy.ml 1 points 1 month ago (1 children)

I use prisma ORM with kysely Query Builder. Prisma has its own schema language that we write with great IDE support and provides a parser to generate type-safe clients. It gives you the ts client generator by default. But for example, kysely also needs types and somebody wrote a prisma-kysely generator, which generates types for kysely based on the prisma schema. Prisma since then also have Typed SQL (type-safe raw sql). (Although, I haven't tried that yet.) So prisma can cover that missing 9% of cases, and there maybe 1% left for untyped raw sql.

Do you think Lutra can replace that 9+1% of cases? Or would it be also useful to write migrations in Lutra?

[–] verstra@programming.dev 1 points 1 month ago

I do believe that it is possible to translate any SQL query to Lutra, that is Lutra can cover that last 1% of cases. There are a few caveats:

  • Some cases would produce very verbose Lutra code because they have special-case syntax in SQL, which makes them terse.
  • Lutra does not cover DDL (CREATE, ALTER, DROP, ADMINISTER). That's because Lutra is conceptually a "run-time" language for dealing with data and not schema modifications. Because of this, Lutra cannot be used for migrations.
  • Lutra is still in development, so you are likely to find cases that are not yet expressible. If you do, please report them, so they can be implemented. But I don't believe that there are cases that would conceptually clash with Lutra language design, like there are with most ORMs.
[–] entwine@programming.dev 2 points 1 month ago (1 children)
func get_album_by_id(album_id: int16): Album -> (
  get_albums()
  | find(func (this) -> this.id == album_id)
)

I'll admit I'm not a database guy, but isn't this inefficient? It looks like it's first querying the DB for all albums, then filtering the results in the interpreter. I assume the db engine has a more optimal implementation for when you do SELECT WHERE query, designed for whatever data structures it's using internally.

Also, minor nitpick but why does it have so many different ways to define a function body?

func something() -> { ... }
func something() -> ( ... )
func something() -> ...
[–] verstra@programming.dev 2 points 1 month ago* (last edited 1 month ago)

Two great questions!

First one comes down to how database query optimization and predicate pushdown in particular. In this case, albums would probably have an index on albums.id column, which would optimize get_album_by_id into a single index lookup. Ideally, I would want to have an explicit function for this, something like sql::from_index("albums", "id", 3), but there is no such thing as explicit index lookup in PostgreSQL right now.

Regarding different function syntaxes:

  • curly braces { ... } construct a new tuple (think object, struct, record),
  • parenthesis are used for precedence. They are not strictly needed for function bodies, but they do give a better visual guide to multi-line definitions, especially when using pipe operator.

So:

func something() -> { ... }  # constructs a new tuple
func something() -> ( ... )  # returns a value
func something() -> ...      # equivalent to ( ... )