SUMMARYThis paper discusses the decidability of node query preservation problems for tree transducers. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLT V ) and an n-ary query based on runs of a tree automaton. We say that a DLT V Tr strongly preserves a query Q if there is a query Q such that for every tree t, the answer set of Q for Tr(t) is equal to the answer set of Q for t. We also say that Tr weakly preserves Q if there is a query Q such that for every t, the answer set of Q for Tr(t) includes the answer set of Q for t. We show that the weak preservation problem is coNP-complete and the strong preservation problem is in 2-EXPTIME. We also show that the problems are decidable when a given transducer is a functional extended linear top-down data tree transducer with regular look-ahead, which is a more expressive transducer than DLT V .

This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data tree transducer (abbreviated as DLT V ) and an n-ary query based on runs of a tree automaton. We say that a DLT V Tr strongly preserves a query Q if there is a query Q such that for every document t, the answer set of Q for Tr(t) is equal to the answer set of Q for t. Also we say that Tr weakly preserves Q if there is a query Q such that for every t d in the range of Tr, the answer set of Q for t d is equal to the union of the answer set of Q for t such that t d = Tr(t). We show that the weak preservation problem is coNP-complete and the strong preservation problem is in 2-EXPTIME.

SUMMARYWe consider the problem of deciding whether a query can be rewritten by a nondeterministic view. It is known that rewriting is decidable if views are given by single-valued non-copying devices such as compositions of single-valued extended linear top-down tree transducers with regular look-ahead, and queries are given by deterministic MSO tree transducers. In this paper, we extend the result to the case that views are given by nondeterministic devices that are not always single-valued. We define two variants of rewriting: universal preservation and existential preservation, and discuss the decidability of them.