Benchmarks LUBM (8000)

The following describes the performance of retrieval and RDFS reasoning with the native AllegroGraph RDFS++ Reasoner and AllegroGraph Prolog using the LUBM benchmark, with on average 20 departments per university.

The total number of files read in is 160,007 N-Triples files, a total of 155 GB. The total number of triples after running the queries is 1.106 billion. In the LUBM(8000) results below, AllegroGraph’s dynamic materialization occurred as necessary to answer each query.  The total query time was 12 minutes and 56 seconds. The table below shows the results of running the LUBM(8000) queries, the results are reported in seconds.

<!-- benchmarks-lubm 8000 -->

<!--

Lubm Query
# Triples
Time
Query 1
4
0.007
Query 2
2,528
278.321
Query 3
6
0.004
Query 4
34
0.027
Query 5
719
0.076
Query 6
83,557,706
389.062
Query 7
67
0.014
Query 8
7,790
0.484
Query 9
2,178,420
96.695
Query 10
4
0.009
Query 11
224
0.009
Query 12
15
0.029
Query 13
37,118
0.030
Query 14
63,400,587
36.867
Summary of LUBM(8000) Results
-->

Results Summary

The platform for the test was 2 – 4 core Intel E5520 Processors at 2.26 GHz, with 48 GB RAM, running Fedora 14.

* With 2 indices, in bulk mode.

# UPI map building.

These queries were performed with full RDFS++ reasoning at query time. Because the LUBM benchmark was designed to test some aspects of OWL reasoning that (by design) are beyond the strength of the RDFS++ reasoner, we added the single triple:

* ub:GraduateStudent rdfs:subClassOf ub:Student

The AllegroGraph RDFS++ Reasoner handles the following RDFS and OWL predicates correctly:

RDFS:

<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>

<http://www.w3.org/2000/01/rdf-schema#subPropertyOf>

<http://www.w3.org/2000/01/rdf-schema#subClassOf>

<http://www.w3.org/2000/01/rdf-schema#range>

<http://www.w3.org/2000/01/rdf-schema#domain>

OWL:

<http://www.w3.org/2002/07/owl#sameAs>

<http://www.w3.org/2002/07/owl#inverseOf>

<http://www.w3.org/2002/07/owl#TransitiveProperty>

 


AllegroGraph with FedShard™ delivers Knowledge Graph Solutions