Skip to content
karussell edited this page Aug 30, 2012 · 30 revisions

All queries are performed on unterfranken (=> path mean length is ~150km) with a 32bit ubuntu and 1.6.0_33 (same results for jdk1.7.0_05). Before measuring query time 50 warmup queries are performed. Then 100 random queries are performed, but for every storage the same.

The mean query time is printed for some selected algorithms and is in ms.

Storage -Xmx dijkstra astar bidijkstra bidijkstra skip[1]
MemoryGraphSafe 300m 450 100 130 50
MMapGraph 300m 510 120 190 nyd[2]
Neo4J 1500m ~1600 730 1190 nyd[2]
[1] bi dijkstra skip = bidirectional dijkstra with an optimized graph (shortcuts for every 2-degree node)
[2] nyd = not yet done

Tests are run with an old Intel Core 2 Duo CPU P8600 @ 2.40GHz. E.g. as a reference the encryption tool "john --test" gives me for "Traditional DES":

Many salts:	1044K c/s real, 1050K c/s virtual
Only one salt:	960486 c/s real, 960486 c/s virtual
Clone this wiki locally