Hidden conditioned homomorphism for XPath fragment containment

Authors:
Yuguo Liao;Jianhua Feng;Yong Zhang;Lizhu Zhou
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China
Venue:
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Year:
2006

Citing 12
Cited 2

Equivalence of datalog queries is undecidable

Journal of Logic Programming
Minimization of tree pattern queries

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Automata theory for XML researchers

ACM SIGMOD Record
Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Decidable Containment of Recursive Queries

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment for XPath Fragments under DTD Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Structural Properties of XPath Fragments

ICDT '03 Proceedings of the 9th International Conference on Database Theory
On the Equivalence of XML Patterns

CL '00 Proceedings of the First International Conference on Computational Logic
XPath Containment in the Presence of Disjunction, DTDs, and Variables

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Tree pattern query minimization

The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)

Homomorphism resolving of XPath trees based on automata

APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
A decision procedure for XPath satisfiability in the presence of DTD containing choice

APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a query language for navigating XML trees and selecting a set of element nodes, XPath is ubiquitous in XML applications. One important issue of XPath queries is checking containment. In particular, we investigate a frequently used fragment of XPath that consists of node tests, the child axis (/), the descendant axis (//), branches ([]) and label wildcards (*). For special classes of pattern trees, the homomorphism algorithm returns false negatives. In order to address this problem, we propose two containment techniques, conditioned homomorphism and hidden conditioned homomorphism, and then present sound algorithms to check containment. The analytical result is given with an experiment.