This looks very interesting, although it seems like they are relying on a very high speed network to get around the latency issues inherent in sharding a graph database. (They mention partitioning, but not whether it occurs online).
Related, my Third Year project is a graph database that loads its data lazily from configurable back ends (databases, caches, APIs, written in Clojure). Now I have more evidence for my dissertation that this kind of tech is useful.
I wonder what their language for queries is going to look like, the only main graph language I've found is Gremlin, which used to be XQuery derived, but recently switched to chained objects.
Related, my Third Year project is a graph database that loads its data lazily from configurable back ends (databases, caches, APIs, written in Clojure). Now I have more evidence for my dissertation that this kind of tech is useful.
I wonder what their language for queries is going to look like, the only main graph language I've found is Gremlin, which used to be XQuery derived, but recently switched to chained objects.