IMO it’s a different question. SQLite and Postgres are both relational databases, it stands to reason that they’re at least doing things in similar ways. They’re two implementations of the same idea(ish). A graph database is something else altogether. Grafting that capability onto a relational database has the potential to perform horribly.

It’s a bad analogy, but SQLite to Postgres is like AMD vs Intel x86 CPUs, whereas a graph database is ARM. Can it be emulated? Yes. Is there a far greater potential for slowdown? Yes.

I think the big difference here is that when comparing SQLite you are at least using the same query language.

In the graph space you have Gremlin, Cryper, GQL and many other proprietary query engines (which also looks to be the the case here).

Without that accessibility this feels a bit like pickling a NetworkX object.

Then maybe no such questions are necessary.