Transforming Tree Patterns with DTDs for Query Containment Test

Authors:
Junhu Wang;Jeffrey Xu Yu;Chengfei Liu;Rui Zhou
Affiliations:
Griffith University, Gold Coast, Australia;Chinese University of Hong Kong, Hong Kong, China;Swinburne University of Technology, Melbourne, Australia;Swinburne University of Technology, Melbourne, Australia
Venue:
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Year:
2008

Citing 7
Cited 0

Containment for XPath Fragments under DTD Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
XPath Containment in the Presence of Disjunction, DTDs, and Variables

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
XPath query containment

ACM SIGMOD Record
Answering tree pattern queries using views

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The complexity of query containment in expressive fragments of XPath 2.0

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On testing satisfiability of tree pattern queries

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of testing xpathquery containment under dtds, where the xpathexpressions are given as tree patterns involving /,//,[] and *, and the dtdare given as acyclic schema graphs. We focus on efficient algorithms to transform a tree pattern Pinvolving * into a new one P茂戮驴 which does not have *, using dtdG, so that testing containment of Pin any other pattern Qunder Gis reduced to testing whether P茂戮驴 is contained in Qwithout dtd, provided Qdoes not have *.