→ Using Datomic as a Graph Database

By vijay on April 11, 2014 — 1 min read

Once the peer’s index caches are warmed, the performance is quite good: most searches I’ve performed between well-known actors complete in under a second, and in many cases, under 100 ms. I never got results that good with Neo4j’s cypher query language.
via Hashrocket Blog – Using Datomic as a Graph Database

Posted in: Programming