On The Suitability of Differential Dataflow For Datalog Interpretation In Highly Dynamic Settings

[Submitted on 4 Aug 2023 (v1), last revised 5 Aug 2026 (this version, v2)]

View PDF HTML (experimental)

Abstract:In the domain of knowledge representation and reasoning within AI, datalog engines play an ever-increasingly crucial role. The crux of their operation lies in materialization: the evaluation of a data- log program and its incorporation into a database. This operation becomes complex and resource-intensive, especially when the data is highly dynamic, as it is common in distributed environments. Thus, incremental materialization, adjusting the computation to new data instead of restarting it, is the norm. However, handling the deletion of data is significantly more complicated than addition due to the cascading effects of what is being removed. Differential Dataflow offers a computational model that effectively addresses this, ensuring consistent performance for both data additions and deletions. In this paper, we delve into the efficiency of materializa- tion using three distinct datalog implementations: one based on a streamlined relational engine and two others that implement the same algorithm, but with one utilizing differential-dataflow, and another not. Our insights provide a roadmap for enhancing datalog- driven computations, particularly in dynamic data environments like the cloud.

Submission history

From: Bruno Rucy Carneiro Alves De Lima [view email]
[v1] Fri, 4 Aug 2023 15:48:47 UTC (147 KB) (withdrawn)
[v2] Wed, 5 Aug 2026 09:43:46 UTC (47 KB)