Hi Scott, Unfortunately, there's no magic pill for distributed graphs. It comes down to the design of the data model and how it's sharded across nodes. Plan your model based on how you intend to query the data and try to arrange your most used domain items to be on the fewest numbers of nodes.
OrientDB's multiple clusters per class model works very well for determining which nodes the data lives on. Good luck! -Colin On Saturday, July 18, 2015 at 1:06:13 PM UTC-5, scott molinari wrote: > > Hi, > > In this video, > > https://vimeo.com/123640016 > > the presenter Max, says towards the end that basically querying > distributed graphs can be a problem. I would imagine OrientDB isn't immune > to this problem either. What has been done to make querying graph data as > performant as possible in OrientDB? Or is it up the the user to make sure > data is properly distributed for querying graphs efficiently? > > Scott > -- --- 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.
