Monadic Datalog Containment on Trees
Logic in Computer Science
2014-04-03 v1 Computational Complexity
Databases
Abstract
We show that the query containment problem for monadic datalog on finite unranked labeled trees can be solved in 2-fold exponential time when (a) considering unordered trees using the axes child and descendant, and when (b) considering ordered trees using the axes firstchild, nextsibling, child, and descendant. When omitting the descendant-axis, we obtain that in both cases the problem is EXPTIME-complete.
Cite
@article{arxiv.1404.0606,
title = {Monadic Datalog Containment on Trees},
author = {André Frochaux and Martin Grohe and Nicole Schweikardt},
journal= {arXiv preprint arXiv:1404.0606},
year = {2014}
}
Comments
This article is the full version of an article published in the proccedings of the 8th Alberto Mendelzon Workshop (AMW 2014)