Abstract
We study the problem of testing xpath query containment under dtds, 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 P involving * into a new one P′ with does not have *, using DTG G, so that testing containment of P in any other pattern Q under G is reduced to testing whether P is contained in Q without dtd, provided Q does not have*. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Wang, J., Yu, J. X., Liu, C., & Zhou, R. (2008). Transforming tree patterns with DTDs for query containment test. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5181 LNCS, pp. 727–734). https://doi.org/10.1007/978-3-540-85654-2_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
