OpenRuleBench: an analysis of the performance of rule engines. The Semantic Web initiative has led to an upsurge of the interest in rules as a general and powerful way of processing, combining, and analyzing semantic information. Since several of the technologies underlying rule-based systems are already quite mature, it is important to understand how such systems might perform on the Web scale. OpenRuleBench is a suite of benchmarks for analyzing the performance and scalability of different rule engines. Currently the study spans five different technologies and eleven systems, but OpenRuleBench is an open community resource, and contributions from the community are welcome. In this paper, we describe the tested systems and technologies, the methodology used in testing, and analyze the results.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Steigmiller, Andreas; Glimm, Birte; Liebig, Thorsten: Reasoning with nominal schemas through absorption (2014)
- Tachmazidis, Ilias; Antoniou, Grigoris; Faber, Wolfgang: Efficient computation of the well-founded semantics over big data (2014)
- Analyti, Anastasia; Antoniou, Grigoris; Damásio, Carlos Viegas; Pachoulakis, Ioannis: A framework for modular ERDF ontologies (2013)
- Alviano, Mario; Faber, Wolfgang; Greco, Gianluigi; Leone, Nicola: Magic sets for disjunctive Datalog programs (2012)
- Areias, Miguel; Rocha, Ricardo: Towards multi-threaded local tabling using a common table space (2012)
- Swift, Terrance; Warren, David S.: XSB: extending Prolog with tabled logic programming (2012)
- Barilaro, Rosamaria; Ricca, Francesco; Terracina, Giorgio: Optimizing the distributed evaluation of stratified programs via structural analysis (2011)