Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Complexity of Nonrecursive XQuery and Functional Query Languages
  on Complex Values   This paper studies the complexity of evaluating functional query languages
for complex values such as monad algebra and the recursion-free fragment of
XQuery.
  We show that monad algebra with equality restricted to atomic values is
complete for the class TA[2^{O(n)}, O(n)] of problems solvable in linear
exponential time with a linear number of alternations. The monotone fragment of
monad algebra with atomic value equality but without negation is complete for
nondeterministic exponential time. For monad algebra with deep equality, we
establish TA[2^{O(n)}, O(n)] lower and exponential-space upper bounds.
  Then we study a fragment of XQuery, Core XQuery, that seems to incorporate
all the features of a query language on complex values that are traditionally
deemed essential. A close connection between monad algebra on lists and Core
XQuery (with ``child'' as the only axis) is exhibited, and it is shown that
these languages are expressively equivalent up to representation issues. We
show that Core XQuery is just as hard as monad algebra w.r.t. combined
complexity, and that it is in TC0 if the query is assumed fixed.

21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol
10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
36
The categories of this paper are: cmp-lg
26
The categories of this paper are: bayes-an