Is there a built-in way to make a unified graph that is both in-memory, but with certain triples persisted on disk? I need to store some user-generated content, but most of the data is generated afresh from an input dataset of XML files on restarts and only exists in-memory.

Such a thing is written but is not yet exposed in any way (I was actually working on it last night). It's a graph that is a Union of in-memory and on disk data. It's in: https://github.com/quoll/asami/blob/main/src/asami/wrapgraph.cljc

You COULD insert data into a database, get the graph out of it, wrap it, and then build a new connection to that graph

It would actually only be a few function calls

The Database history won't work properly yet. This is part of what I hope to do today

Another feature I’d like to have is the ability to query graph unions, like in SPARQL (I use this feature a lot, and I want it for Asami too)

But… I don't have the resources to get that done soon

Thank you, Paula!

I’ll experiment with it

Have you ever written code that took you far too long to get done, and when you've got to that "it compiles!" point you have a sense of relief, and you just want to celebrate, even though you have yet to run and test it?

Well... that's where the with function is now.

at long last

tests will be forthcoming, and then I can make a release