We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the root of a tree pattern query to match the root of a tree, validity of a non-branching tree pattern query with respect to a Relax NG schema or W3C XML Schema is already EXPTIME-hard when the query does not branch and uses only child axes. These hardness results already hold when the alphabet size is fixed. Validity with respect to a DTD is proved to be EXPTIME-hard already when the query only uses child axes and is allowed to branch only once. © 2013 Springer-Verlag.
CITATION STYLE
Björklund, H., Martens, W., & Schwentick, T. (2013). Validity of tree pattern queries with respect to schema information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8087 LNCS, pp. 171–182). https://doi.org/10.1007/978-3-642-40313-2_17
Mendeley helps you to discover research relevant for your work.