2011/9/10 Linan Wang tali.w...@gmail.com
Andreas,
thanks. can't wait for your result.
one correction on my list:
Retrieve a certain types of relationships of a node should be faster
than retrieve all. i mis-read the source code in NodeImpl.java, in
which private volatile RelIdArray[]
Andreas,
thanks. can't wait for your result.
one correction on my list:
Retrieve a certain types of relationships of a node should be faster
than retrieve all. i mis-read the source code in NodeImpl.java, in
which private volatile RelIdArray[] relationships is an array of
array.
the updated list:
hi,
I once read a blog about how long it take for computation operations
such as read from L1 cache, RAM access, send packet from usa to eu,
etc. having a rough idea of the relative cost of major computation
operations, we have better control. for example, in my project i also
use property to
Hi Linan,
These are good questions. I am currently following a similar approach to
characterizing the performance of basic graph operations, and then also simple
graph algorithms on various shapes of graphs. My initial investigation is on
small graphs on my laptop, but this weekend I'm testing
4 matches
Mail list logo
