Hello OrientDB community, I've been following the discussions of this group in stealth-mode for a while, and even looking through the archives I could not find an answer to my question, therefore it's time to ask you all. I've personally never used OrientDB until today.
I need to store a very large graph (+60M nodes, approximately 400M edges). Nodes are labeled with few attributes (floats, strings), and so are the edges. The overall memory footprint of the resulting graph makes it impractical to store everything on a single-machine, even one with 16GB of memory. Can OrientDB automatically shard (via some kind of semi/automatic graph-clustering) a large graph across a set of OrientDB nodes ? How the nodes communicate to each other ? Is there some rebalancing mechanism in the case a graph-cluster becomes too big ? Finally, have you seen [1] comparing 4 graph databases (including OrientDB) ? It does not win in all cases, and maybe it might serve as a good motivator to boost even more the performances of the system. Thanks, Valerio 1 - http://www.odbms.org/wp-content/uploads/2014/05/an-empirical-comparison-of-graph-databases.pdf -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
