2016/12/30 by Stefan Brass, Heike Stephan
Business, Management and Accounting · Computer Science · #Advanced Database Systems and Queries #Benchmark (surveying) #Business Process Modeling and Analysis #Data Mining Algorithms and Applications #Datalog #Deductive database #Implementation #Suite #Task (project management) #Tuple #cs.DB #cs.LO #cs.PF
paper · pdf · doi:10.4204/eptcs.234.5
published as EPTCS 234, 2017, pp. 57-72 · In Proceedings WLP'15/'16/WFLP'16, arXiv:1701.00148
openalex publication_date 2016/12/30 · arxiv created 2017/01/03 · arxiv updated 2017/01/04 · openalex created_date 2017/01/06 · openalex updated_date 2026/08/05
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.