Hi,
I've recently set up a db with 500K nodes and 16M edges (distributed, 2
instances on aws, ubuntu 16, java 8, version 2.2.13). I'm running:
select count(*) from (traverse out('MyEdge') from (SELECT FROM MyVertex
WHERE id = <my-id> ) while $depth <= 2) where $depth >= 1
and can take anywhere in the 1-60 second range, average around 10 seconds.
This coincides with a power law social graph structure ranging from 0-500
edges per node.
Roughly speaking, what performance would you expect from this sort of
graph? Is there something definitely wrong in my configuration that would
cause these response times or is it a not so unexpected behavior?
I will be fetching and aggregating data from nodes at 1,2 and 3 degrees (to
generate ego network features, for example average/max/min age at 2nd
degree) and was hoping to have responses within a 0-5 second response time.
Any help/suggestions?
Thanks in advance,
Tomas
--
---
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 orient-database+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
