Abstract
We show that evaluating positive Datalog programs in a bottom-up manner can be modelled as a "circuit" of facts and rules where both can be freely added and retracted during runtime. This is realised by writing a definitional interpreter as a higher order program that defines bottom-up evaluation in terms of Database Stream Processing Theory (DBSP) operators that have incremental semantics. Our approach is compared against Soufflé, and DDLog. Up to almost 10 times faster performance is exhibited when handling incremental updates compared to DDLog, and 2 times when compared to Soufflé.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2-16 |
| Number of pages | 15 |
| Journal | CEUR Workshop Proceedings |
| Volume | 3801 |
| State | Published - 2024 |
| Event | 5th International Workshop on the Resurgence of Datalog in Academia and Industry, Datalog-2.0 2024 - Dallas, United States Duration: Oct 11 2024 → … |
Keywords
- Bottom-up Evaluation
- Datalog
- DBSP
- Incremental View Maintenance
ASJC Scopus subject areas
- General Computer Science