Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient algorithms for minimizing tree pattern queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The XML benchmark project
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Using semantics for XPath query transformation
International Journal of Web and Grid Services
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
Examining the impact of data-access cost on XML twig pattern matching
Information Sciences: an International Journal
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. Since the size of a TPQ is a key determinant of its evaluation cost, recent research has focused on the problem of query minimization using integrity constraints to eliminate redundant query nodes; specifically, TPQ minimization has been studied for the class of forward and subtype constraints (FT-constraints). In this paper, we explore the TPQ minimization problem further for a richer class of FBST-constraints that includes not only FT-constraints but also backward and sibling constraints. By exploiting the properties of minimal queries under FBST-constraints, we propose efficient algorithms to both compute a single minimal query as well as enumerate all minimal queries. In addition, we also develop more efficient minimization algorithms for the previously studied class of FT-constraints. Our experimental study demonstrates the effectiveness and efficiency of query minimization using FBST-constraints.