|
|
|||||||||||||
|
|
|
|
|
|
|
|
|
||||||
|
|
|||||||||||||
     
|
AllegroGraph 2.2.5 Benchmark for LUBM-50-0 The following table describes the performance of retrieval and RDFS reasoning with the native AllegroGraph RDFS++ Reasoner and AllegroGraph Prolog. We used the LUBM benchmark for 50 universities with on average 20 departments per university. The total number of files read in is 1000. The total time for loading and indexing is 8 minutes. The total number of triples after running the queries is 6,875,705. 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, 1000 triples were pre-inferred at load time using the necessary OWL reasoning and added into the LUBM 50 data store before running the LUBM queries with RDFS++ reasoning. Additionally, we do not pre-cache all of the type inferences that can be made. In this way, we have rephrased the LUBM benchmark as an RDFS++ challenge problem and can verify that the RDFS++ reasoner is returning the correct answers. The platform for the test was a single 64-bit processor AMD Opteron, with 16 Gb of memory. Download the benchmark files here. The AllegroGraph RDFS++ Reasoner handles the following RDFS and OWL predicates correctly: RDFS: OWL: The AllegroGraph Reasoner does not handle full OWL restrictions. For that we recommend RacerPro. Table 1: Summary of Results
Download the Lubm 50 Benchmark files to run in LispThere are 3 files to download: Note that the lubm.tar.gz dataset is 36 Megabytes. When unpacked, it expands to about 1.2 Gigabytes.
© 2008 Franz Inc - Privacy Statement |
