On 19 Dec 2013, at 9:10 AM, Johannes Kroll <johannes.kroll(a)wikimedia.de> wrote:
If I have to
fetch successor lists and compute it by myself it will be 100-1000x slower. If I ask for a
successor list, how much time per arc, overall, will it take? This is the standard measure
for the speed of a graph representation. I can't evince anything from the example you
quote.
I think you can. You can even run any query yourself. Try something
like:
curl
http://sylvester.wmflabs.org:8090/dewiki/traverse-successors+235276+9999 | head
You'll get something like:
OK. 102243 nodes, 0.160605s:
235276
338
464
1704
[...]
1570ns/arc.
Do you think we computed the degrees of separation of Facebook using a service like that?
Of a 700M nodes/69B edges graph?
You have no idea of what's "scaling". Read the "Four degrees of
separation" paper.
Ciao,
seba