We have a immutable chain structure in TerminusDB which allows for straightforward uncoordinated multi-read access or multi-version concurrency control. This approach also makes branching simple to implement. Any number of new layers can point to the same former parent layer.
You might like this white paper (but for reasons above you will have to overlook some of the OWL information): https://github.com/terminusdb/terminusdb/blob/dev/docs/white...
For instance you might put a "record" into a knowledge graph that describes some topic like
https://www.wikidata.org/wiki/Q108937326
and then later decide to delete it. The "record" consists of not just the
patterns such that but also other patterns that involve "blank nodes" that are necessary to make statements that go beyond what a single triple can express.You can reconstitute the relational database without "rows" (e.g. turn a relational database into a graph and do OWL inference on that graph, or run SQL queries against a database with a columnar organization) but the row concept, like the document concept in document-oriented databases provides a boundary for updating records that (mostly) works even in the absence of transactional semantics.
Many of the older approaches to implementing transactions were row-centric, although newer MVCC approaches apply just fine to graph systems.