datomic claims to solve the O/R impedance mismatch -- the "vietnam of computer science"[0] -- which is why datomic matters to application developers.
"... The facts the Storage Service returns never change, so Peers do extensive caching ... Once a Peer's working set is cached, there is little or no network traffic for reads ..." [1, paragraph 4]
this basically means that your reads are VERY fast -- in-memory fast -- which means you can program as if your data wasn't in a database.
"... The facts the Storage Service returns never change, so Peers do extensive caching ... Once a Peer's working set is cached, there is little or no network traffic for reads ..." [1, paragraph 4]
this basically means that your reads are VERY fast -- in-memory fast -- which means you can program as if your data wasn't in a database.
[0] http://www.codinghorror.com/blog/2006/06/object-relational-m... [1] http://docs.datomic.com/architecture.html
ps video is only 14 minutes long, worth a watch