Abstract
The XPath satisfiability problem is to decide, for an XPath expression q and a DTD D, if there exists an XML document t valid against D such that the answer of q on t is nonempty. It is shown that the satisfiability problem is intractable for many XPath fragments. In this paper, we focus on fixed DTDs and consider the problem under fixed DTDs. We first show that, for a very restricted XPath fragment, the satisfiability problem is NP-complete under fixed DTDs. Then we show several XPath fragments for which satisfiability is in PTIME under fixed DTDs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
