Research map / Learning theory and algorithms / Combinatorial and search optimization
Optimised Maintenance of Datalog Materialisations
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add separate counters for nonrecursive and recursive derivations and use them to avoid backward rule evaluation | DRed · SSPE | running time (seconds): 1,684.97 -> 10.53 | Helped |
| Add nonrecursive derivation counters and restrict backward evaluation to recursive rules | B/F · UOBM-U | running time (seconds): 31.96 -> 1.18 | Helped |
| Add nonrecursive derivation counters and restrict backward evaluation to recursive rules | B/F · Reactome-U | running time (seconds): 1.00 -> 0.05 | Helped |
| Add nonrecursive derivation counters and restrict backward evaluation to recursive rules | B/F · SSPE | running time (seconds): 252.97 -> 247.00 | No clear effect |
| Add separate counters for nonrecursive and recursive derivations | DRed · Reactome-U, large deletion | running time (seconds): 6.32 k -> 30.70 | Helped |
| Add nonrecursive derivation counters and restrict backward evaluation to recursive rules | B/F · ChemBL-R, 1,000-fact deletion | running time (seconds): 1.26 -> 1.27 | No clear effect |
| Use DRed^c instead of B/F^c, eliminating backward evaluation entirely rather than only for nonrecursive rules | DRed^c and B/F^c · SSPE, 1,000-fact deletion | running time (seconds): 247.00 -> 10.53 | Helped |
| Maintain derivation counters during rematerialisation | Remat · all large-deletion benchmarks | running time | Hurt |
Closest papers by meaning
- Optimised Storage for Datalog Reasoning (AAAI 2024 · similarity 0.91)
- Modular Materialisation of Datalog Programs (AAAI 2019 · similarity 0.91)
- Computing the Why-Provenance for Datalog Queries via SAT Solvers (AAAI 2024 · similarity 0.83)
- Goal-Driven Reasoning in DatalogMTL with Magic Sets (AAAI 2025 · similarity 0.82)
- Column-Oriented Datalog on the GPU (AAAI 2025 · similarity 0.81)
- LogicCat: A Chain-of-Thought Text-to-SQL Benchmark for Complex Reasoning (AAAI 2026 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.