Monadic Datalog Containment on Trees
Andr\'e Frochaux, Martin Grohe, Nicole Schweikardt
TL;DR
This paper analyzes the computational complexity of the query containment problem for monadic datalog on finite unranked labeled trees, providing precise complexity bounds for different tree structures and axes.
Contribution
It establishes tight complexity bounds for monadic datalog containment on trees, differentiating between ordered and unordered cases and specific axes used.
Findings
Containment problem is 2-fold exponential time for certain axes
Omitting the descendant-axis reduces complexity to EXPTIME-complete
Results differentiate between ordered and unordered tree cases
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Formal Methods in Verification · Graph Theory and Algorithms