On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
From MaRDI portal
Publication:5310660
DOI10.2168/LMCS-2(3:1)2006zbMath1126.68376MaRDI QIDQ5310660
Thomas Schwentick, Frank Neven
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Related Items (13)
Deciding twig-definability of node selecting tree automata ⋮ Deciding definability by deterministic regular expressions ⋮ Containment of Monadic Datalog Programs via Bounded Clique-Width ⋮ Reasoning about integrity constraints for tree-structured data ⋮ Weak containment for partial words is coNP-complete ⋮ On the complexity of tree pattern containment with arithmetic comparisons ⋮ Schemas for unordered XML on a DIME ⋮ Conjunctive query containment over trees using schema information ⋮ Reasoning about XML update constraints ⋮ Numerical constraints on XML data ⋮ Reasoning about XML with temporal logics and automata ⋮ Least common container of tree pattern queries and its applications ⋮ On the Notion of an XML Key
Uses Software
This page was built for publication: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
