Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation

OpenRuleBench is a large benchmark suite for rule engines, which includes deductive databases. We previously proposed a translation of Datalog to C++ based on a method that "pushes" derived tuples immediately to places where they are used. In this paper, we report performance results of va...

Full description

Bibliographic Details
Main Authors: Stefan Brass, Heike Stephan
Format: Article
Language:English
Published: Open Publishing Association 2017-01-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1701.00627v1
id doaj-c39c4119469a409f91de502394b62f9d
record_format Article
spelling doaj-c39c4119469a409f91de502394b62f9d2020-11-25T01:33:41ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802017-01-01234Proc. WLP 2015/'16/WFLP'16577210.4204/EPTCS.234.5:203Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up EvaluationStefan Brass0Heike Stephan1 University of Halle University of Halle OpenRuleBench is a large benchmark suite for rule engines, which includes deductive databases. We previously proposed a translation of Datalog to C++ based on a method that "pushes" derived tuples immediately to places where they are used. In this paper, we report performance results of various implementation variants of this method compared to XSB, YAP and DLV. We study only a fraction of the OpenRuleBench problems, but we give a quite detailed analysis of each such task and the factors which influence performance. The results not only show the potential of our method and implementation approach, but could be valuable for anybody implementing systems which should be able to execute tasks of the discussed types.http://arxiv.org/pdf/1701.00627v1
collection DOAJ
language English
format Article
sources DOAJ
author Stefan Brass
Heike Stephan
spellingShingle Stefan Brass
Heike Stephan
Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation
Electronic Proceedings in Theoretical Computer Science
author_facet Stefan Brass
Heike Stephan
author_sort Stefan Brass
title Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation
title_short Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation
title_full Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation
title_fullStr Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation
title_full_unstemmed Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation
title_sort experiences with some benchmarks for deductive databases and implementations of bottom-up evaluation
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2017-01-01
description OpenRuleBench is a large benchmark suite for rule engines, which includes deductive databases. We previously proposed a translation of Datalog to C++ based on a method that "pushes" derived tuples immediately to places where they are used. In this paper, we report performance results of various implementation variants of this method compared to XSB, YAP and DLV. We study only a fraction of the OpenRuleBench problems, but we give a quite detailed analysis of each such task and the factors which influence performance. The results not only show the potential of our method and implementation approach, but could be valuable for anybody implementing systems which should be able to execute tasks of the discussed types.
url http://arxiv.org/pdf/1701.00627v1
work_keys_str_mv AT stefanbrass experienceswithsomebenchmarksfordeductivedatabasesandimplementationsofbottomupevaluation
AT heikestephan experienceswithsomebenchmarksfordeductivedatabasesandimplementationsofbottomupevaluation
_version_ 1725076435519930368