The complexity of query containment in expressive fragments of XPath 2.0

@inproceedings{Cate2007TheCO,
  title={The complexity of query containment in expressive fragments of XPath 2.0},
  author={Balder ten Cate and Carsten Lutz},
  booktitle={PODS},
  year={2007}
}
Query containment has been studied extensively for fragments of XPath 1.0. For instance, the problem is known to be ExpTime-complete for CoreXPath, the navigational core of XPath 1.0. Much less is known about query containment in (fragments of) the richer language XPath 2.0. In this paper, we consider extensions of CoreXPath with the following operators, which are all part of XPath 2.0 (except the last): path intersection, path equality, path complementation, for-loops, and transitive closure… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 45 extracted citations

High-performance complex event processing over XML streams

SIGMOD Conference • 2012
View 20 Excerpts
Highly Influenced

Logical Foundations of XML and XQuery

Reasoning Web • 2009
View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Similar Papers

Loading similar papers…