Satisfiability of Simple XPath Fragments under Duplicate-Free DTDs Satisfiability of Simple XPath Fragments under Duplicate-Free DTDs
Access this Article
Search this Article
In this paper, we consider the XPath satisfiability problem under restricted DTDs called “duplicate free”. For an XPath expression <i>q</i> and a DTD <i>D</i>, <i>q</i> is <i>satisfiable</i> under <i>D</i> if there exists an XML document <i>t</i> such that <i>t</i> is valid against <i>D</i> and that the answer of <i>q</i> on <i>t</i> is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an empty set without evaluating it. However, it is shown that the XPath satisfiability problem is intractable for a large number of XPath fragments. In this paper, we consider simple XPath fragments under two restrictions: (i) only a label can be specified as a node test and (ii) operators such as qualifier ([ ]) and path union (<i>∪</i>) are not allowed. We first show that, for some small XPath fragments under the above restrictions, the satisfiability problem is NP-complete under DTDs without any restriction. Then we show that there exist XPath fragments, containing the above small fragments, for which the satisfiability problem is in PTIME under duplicate-free DTDs.
- IEICE Transactions on Information and Systems
IEICE Transactions on Information and Systems E96.D(5), 1029-1042, 2013
The Institute of Electronics, Information and Communication Engineers