Validity of Tree Pattern Queries with Respect to Schema Information

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...

Full description

Saved in:
Bibliographic Details
Published inMathematical Foundations of Computer Science 2013 pp. 171 - 182
Main Authors Björklund, Henrik, Martens, Wim, Schwentick, Thomas
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Conjunctive Query
Regular Expression
Tiling System
Tree Automaton
Winning Strategy
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783642403125
3642403123
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-40313-2_17