Combined Tractability of Query Evaluation via Tree Automata and Cycluits
From MaRDI portal
Publication:3174894
DOI10.4230/LIPIcs.ICDT.2017.6zbMath1402.68039arXiv1612.04203OpenAlexW3103492182MaRDI QIDQ3174894
Antoine Amarilli, Mikaël Monet, Pierre Bourhis, Pierre Senellart
Publication date: 18 July 2018
Full work available at URL: https://arxiv.org/abs/1612.04203
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Formal languages and automata (68Q45)
Related Items (3)
An epistemic approach to model uncertainty in data-graphs ⋮ Evaluating Datalog via tree automata and cycluits ⋮ Connecting knowledge compilation classes and width parameters
This page was built for publication: Combined Tractability of Query Evaluation via Tree Automata and Cycluits
