A DIfferential Datalog Interpreter

EasyChair Preprint 10666

Abstract

The core reasoning task for datalog engines is materialization, the evaluation of a datalog program over a database alongside its physical incorporation into the database itself. The de-facto method of computing it, is through the recursive application of inference rules. Due to it being a costly operation, it is a must for datalog engines to provide incremental materialization, that is, to adjust the computation to new data, instead of restarting from scratch. One of the major caveats, is that deleting data is notoriously more involved than adding, since one has to take into account all possible data that has been entailed from what is being deleted. Differential Dataflow is a computational model that provides efficient incremental maintenance, notoriously with equal performance between additions and deletions, and work distribution, of iterative dataflows. In this paper we investigate the performance of materialization with three reference datalog implementations, out of which one is built on top of a lightweight relational engine, and the two others are differential-dataflow and non-differential versions of the same rewrite algorithm, with the same optimizations.

Keyphrases: Databases, Datalog, Differential Dataflow

@booklet{EasyChair:10666,
  author    = {Matthew Stephenson},
  title     = {A DIfferential Datalog Interpreter},
  howpublished = {EasyChair Preprint 10666},
  year      = {EasyChair, 2023}}