Hi
I'm using an OrientDB graph database in an EU-funded FP7 project to support data-based AI risk analysis algorithms. In each algorithm, I frequently (e.g., 40-50 times in a single algorithm) need to get "all the vertices of type X, outgoing from N", or "all the vertices of type X, incoming into N" To do this, I use queries such as these: select expand( inV() ) from (select from ChildOf where #11:0=out and in.tag='ras') select expand( outV() ) from (select from Link where #12:1898=in and name='layer-entity') The problem is that a single query like this takes ~0.5 seconds (50 millis), and this means that when in the database there are a few tens of records, the time of some algorithms goes quickly to the tens of seconds, which makes them unusable. I've pushed to adopt OrientDB for its "conceptual" beauty, but I never ran into this kind of hard speed requirements. Is this time normal for what I'm doing? What should I check and what could I do differently (apart from changing the whole logic behind the algorithms)? Thank you for any suggestion -- --- 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.
