On Thu, 19 Dec 2013 09:16:46 -0800
Sebastiano Vigna <vigna(a)di.unimi.it> wrote:
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.
As opposed to your number which I still can't reproduce...
Do you think we computed the degrees of separation of
Facebook using a service like that? Of a 700M nodes/69B edges graph?
No, I don't. And why on earth would you want to use CatGraph to do that?
Did you even read my last message before replying to it? CatGraph is a
tool with specific purposes. Computing degrees of separation of
Facebook is definately not one of them. Now, please, don't reply unless
you actually read what I wrote.
--
Johannes Kroll
Softwareentwickler
Wikimedia Deutschland e.V. | Tempelhofer Ufer 23-24 | 10963 Berlin
Tel. (030) 219 158 26-0
http://wikimedia.de
Wikimedia Deutschland - Gesellschaft zur Förderung Freien Wissens e.V.
Eingetragen im Vereinsregister des Amtsgerichts Berlin-Charlottenburg
unter der Nummer 23855 B. Als gemeinnützig anerkannt durch das
Finanzamt für Körperschaften I Berlin, Steuernummer 27/681/51985.