2014/04/02 by André Frochaux, Frochaux, André, Martin Grohe +3
Computer Science · #Computational Complexity (cs.CC) #Databases (cs.DB) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.CC #cs.DB #cs.LO
paper · pdf · doi:10.48550/arxiv.1404.0606
This article is the full version of an article published in the proccedings of the 8th Alberto Mendelzon Workshop (AMW 2014)
arxiv created 2014/04/02 · arxiv updated 2014/04/03
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.