论文信息 - Transforming Tree Patterns with DTDs for Query Containment Test

Transforming Tree Patterns with DTDs for Query Containment Test

We study the problem of testing xpath query containment under dtd s, where the xpath expressions are given as tree patterns involving /,//,[] and *, and the dtd are given as acyclic schema graphs. We focus on efficient algorithms to transform a tree pattern Pinvolving * into a new one Pi¾? which does not have *, using dtd G, so that testing containment of Pin any other pattern Qunder Gis reduced to testing whether Pi¾? is contained in Qwithout dtd , provided Qdoes not have *.

Jeffrey Xu Yu | Junhu Wang | Chengfei Liu | Rui Zhou

[1] Peter T. Wood,et al. Containment for XPath Fragments under DTD Constraints , 2003, ICDT.

[2] Laks V. S. Lakshmanan,et al. On Testing Satisfiability of Tree Pattern Queries , 2004, VLDB.

[3] Dan Suciu,et al. Containment and equivalence for a fragment of XPath , 2004, JACM.

[4] Gabriel M. Kuper,et al. Structural Properties of XPath Fragments , 2003, ICDT.

[5] Thomas Schwentick,et al. XPath query containment , 2004, SGMD.

[6] Thomas Schwentick,et al. XPath Containment in the Presence of Disjunction, DTDs, and Variables , 2003, ICDT.