A note on monadic datalog on unranked trees
نویسندگان
چکیده
In the article Recursive queries on trees and data trees (ICDT’13), Abiteboul et al. asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is decidable. This note gives a positive answer to this question, as well as an overview of the relative expressive power of monadic datalog on various representations of unranked trees.
منابع مشابه
Querying Unranked Trees with Stepwise Tree Automata
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second-order logic. We prove this result by reduction to the ranked case, via a new systematic correspondence that relates unranked and ranked queries.
متن کاملMonadic Datalog Containment on Trees
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 Expti...
متن کاملQuery Evaluation on Compressed Trees
This paper studies the problem of evaluating unary (or nodeselecting) queries on unranked trees compressed in a natural structure-preserving way, by the sharing of common subtrees. The motivation to study unary queries on unranked trees comes from the database field, where querying XML documents, which can be considered as unranked labelled trees, is an important task. We give algorithms and co...
متن کاملMonadic Datalog Containment on Trees Using the Descendant-Axis
In their AMW’14-paper, Frochaux, Grohe, and Schweikardt showed that the query containment problem for monadic datalog on finite unranked labeled trees is Exptime-complete when (a) considering unordered trees using the child-axis, and when (b) considering ordered trees using the axes firstchild, nextsibling, and child. Furthermore, when allowing to use also the descendant-axis, the query contain...
متن کاملMSO Querying over Trees via Datalog Evaluation
The MSO evaluation problem on trees is the problem of computing, for any MSO formula φ and any finite tree T , the set of satisfying assignments of φ(X1, . . . ,Xk) over T . In [3] we considered the MSO evaluation problem on full binary trees as a Datalog query evaluation problem, and gave a Datalog-theoretic solution to it for any MSO formula φ; we thus subsumed previous results obtained for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1310.1316 شماره
صفحات -
تاریخ انتشار 2013