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. Loading* required a total of 48 minutes and 30 seconds. The index time# was 25 minutes and 2 seconds. 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.

Summary of LUBM(8000) Results

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 turns complex data into actionable business insights