Datomic Transactor

In this chapter, we implement a strict-serializable key-value store by following Datomic's transactor approach: data is stored in an eventually consistent key-value store, and a single mutable reference to that data is stored in a linearizable key-value store.

1. A single-node transactor
2. Shared state
3. Persistent Trees
4. Optimization