Basic MONADIC Benchmark

MONADIC stands for "MONotone Abduction Deduction Induction Cycles". The benchmark tests a query http://josd.github.io/bmb/query.n3 on 10 RDF entities with increasing size (up to 1 billion triples in total).

The data is synthetic as can be seen in the first example http://josd.github.io/bmb/1tt1.n3 and the full set of RDF entities is generated with the program http://josd.github.io/bmb/graphgen.n3

The query is looking for particular patterns and it all fits nicely in the context of "seeking rare patterns in large amounts of data".

       triples   cycles |         cwm         eye        jena
                        |       [sec]       [sec]       [sec]
------------------------|------------------------------------
        10,000    1,518 |      15.400       0.420       3.200
       100,000      645 |      99.860       2.190       9.310
     1,000,000      380 |   1,094.860      21.170      75.380
    10,000,000      480 |  (OutOfMem)     231.610     853.060
   100,000,000      480 |               2,640.580   9,217.800
 1,000,000,000      431 |              32,474.540  (OutOfMem)


Test environment:

Linux 4.0.5 x86_64
processor	: 0
model name	: Intel(R) Xeon(R) CPU E5-2665 0 @ 2.40GHz
processor	: 1
model name	: Intel(R) Xeon(R) CPU E5-2665 0 @ 2.40GHz
processor	: 2
model name	: Intel(R) Xeon(R) CPU E5-2665 0 @ 2.40GHz
processor	: 3
model name	: Intel(R) Xeon(R) CPU E5-2665 0 @ 2.40GHz
MemTotal:       264163268 kB

• triples are generated with

eye graphgen.n3

• test with Cwm

./test_cwm

• test with EYE

./test_eye

• test with Jena

./test_jena