Just as document dbs can be derived/denormalized from SQL dbs, relational dbs can be derived from a graph.
Conceptually, data is a graph.
I always find the decision between 1-M and M-M is so sticky with RDBMS, and with a graph, it can be whatever you want it to be.
So I will try it again, see if it works this time around.
- Datomic
- Crux
- Datahike
- DataScript
- Datalevin
Some of them running in the browser, which power Roam Research and its clones
- Athens
- Logseq
- Obsidian
Also, "no-SQL databases" is like "non-green colors"; it encompasses a much larger spectrum than it excludes. Putting graph databases, local KV stores, distributed KV stores, document stores, time-series stores, etc in the same basket just because they are not RDBMSes is not very productive.
Nothing new or interesting in this article.
This person thinks they are glorified caches, but they miss what they are good at, REALLY fast aggregation across many servers, that isn't a glorified cache, that is something else.
Sometimes you want user defined queries which are easy to restrict to parts of a dataset by rules.
If you don't have a use case for something, it doesn't mean no one else does.