Earlier quoted context omitted.
I think their statement about ACID is too bold. How does somebody do read-"modify" style of transactions ? Say I want to bump some counter. So I delete old fact and I establish new fact. But new fact needs to be exactly 1 + old value of counter. With transactions as simple "add this and remove that" you seemingly cannot do that. So it's not ACID. Right?
From what I remember, compare-and-swap semantics are in place for that kind of case. If that was not the case, you could still model such an order-dependent update as the fact that the counter has seen one more hit. Let the final query reduce that to the final count, and let the local cache implementation optimize that cost away for all but the first query, and then incrementally optimize the further queries when the…
Re: Rich Hickey's new project: datomic.com
#111Forget my last paragraph. Anyways, richhickey answered. :)