Combined Tractability of Query Evaluation via Tree Automata and Cycluits - Archive ouverte HAL Access content directly
Conference Papers Year :

Combined Tractability of Query Evaluation via Tree Automata and Cycluits

(1) , (2) , (1, 3) , (3, 4)
1
2
3
4

Abstract

We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We introduce a new Datalog fragment with stratified negation, intensional-clique-guarded Datalog (ICG-Datalog), with linear-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 compiling to alternating two-way automata, whose semantics is defined via cyclic provenance circuits (cycluits) that can be tractably evaluated. Last, we prove that probabilistic query evaluation remains intractable in combined complexity under this parameterization.
Fichier principal
Vignette du fichier
amarilli2017combined.pdf (469.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01439294 , version 1 (18-01-2017)

Identifiers

Cite

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart. Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT 2017 - International Conference on Database Theory, Mar 2017, Venice, Italy. ⟨10.4230/LIPIcs.ICDT.2017.6⟩. ⟨hal-01439294⟩
500 View
114 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More