Minimal common container of tree patterns

Authors:
Junhu Wang;Jeffrey Xu Yu;Chaoyi Pang;Chengfei Liu
Affiliations:
Griffith University, Gold Coast, Australia;Chinese University of Hong Kong, Hong Kong, China;CSIRO, Brisbane, Australia;Swinburne University of Technology, Melbourne, Australia
Venue:
Proceedings of the 18th ACM conference on Information and knowledge management
Year:
2009

Citing 4
Cited 0

Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Structural properties of XPath fragments

Theoretical Computer Science - Database theory
Answering tree pattern queries using views

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patterns P1, ..., Pn, there exists another pattern P (tree pattern or DAG-pattern) such that P1, ..., Pn, are all contained in P, and for any tree pattern Q belonging to a given class C, P1, ..., Pn, are contained in Q implies P is contained in Q.