Deciding XPath containment with MSO
نویسندگان
چکیده
منابع مشابه
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath fragment covers most of the language features used in practice. Specifically, we show how XPath queries can be translated into equivalent formulas in monadic second-order logic. Using this translation, we construct an o...
متن کاملComparison of XPath Containment Algorithms
The complexity of implementing a sound, complete and efficient algorithm to detect containment (and by extension equivalence) in XPath fragments has frustrated previous attempts by computer scientists. Some algorithms have been developed to deal with these problems but these have lacked either in completeness, efficiency, or soundness, working only when restrictions in the type of XPath fragmen...
متن کاملContainment and Integrity Constraints for XPath Fragments
XPath is a W3C standard that plays a crucial role in several in uential query, transformation, and schema standards for XML. Motivated by the larger challenge of XML query optimization, we investigate the problem of containment of XPath expressions under integrity constraints that are in turn formulated with the help of XPath expressions. Our core formalism consists of a fragment of XPath that ...
متن کاملContainment for XPath Fragments under DTD Constraints
The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments , deciding containment (and even minimisation) has been shown to be in ptime, while for minor extensions containment has been shown to be conp-complete. When containment is with respect to trees satisfying a set of constraints (such as a schema or DTD), the proble...
متن کاملContainment between Unions of XPath Queries
In this paper, we address the containment problem for unions of XPath queries with and without schema. We find the problem can be always reduced into containment problem between one single query and a union of queries. When schema is not available, the problem can be further reduced into checking containment between pairwise queries (each from one union), but this only holds for some XPath subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data & Knowledge Engineering
سال: 2007
ISSN: 0169-023X
DOI: 10.1016/j.datak.2006.11.003