Evaluating Datalog via Tree Automata and Cycluits

Antoine Amarilli 1 Pierre Bourhis 2 Mikaël Monet 1, 3 Pierre Senellart 3, 1
1 DIG - Data, Intelligence and Graphs
LTCI - Laboratoire Traitement et Communication de l'Information
3 VALDA - Value from Data
DI-ENS - Département d'informatique de l'École normale supérieure, Inria de Paris
Abstract : We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We show that clique-frontier-guarded Datalog with stratified negation (CFG-Datalog) enjoys bilinear-time evaluation on structures of bounded treewidth for programs of bounded rule size. Such programs capture in particular conjunctive queries with simplicial decompositions of bounded width, guarded negation fragment queries of bounded CQ-rank, or two-way regular path queries. Our result is shown by translating to alternating two-way automata, whose semantics is defined via cyclic provenance circuits (cycluits) that can be tractably evaluated.
Document type :
Journal articles
Complete list of metadatas

Contributor : Pierre Senellart <>
Submitted on : Wednesday, October 10, 2018 - 8:27:07 AM
Last modification on : Wednesday, August 28, 2019 - 10:39:54 AM

Links full text



Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Evaluating Datalog via Tree Automata and Cycluits. Theory of Computing Systems, Springer Verlag, 2019, 63 (7), pp.1620-1678. ⟨10.1007/s00224-018-9901-2⟩. ⟨hal-01891811⟩



Record views