The following pages link to Tree pattern query minimization (Q1811333):
Displayed 16 items.
- Solutions in XML data exchange (Q389225) (← links)
- Rewriting XPath queries using materialized XPath views (Q439966) (← links)
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
- Least common container of tree pattern queries and its applications (Q715041) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Numerical constraints on XML data (Q964502) (← links)
- Efficient inclusion for a class of XML types with interleaving and counting (Q964806) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Tree size reduction with keeping distinguishability (Q1630987) (← links)
- Tractable XML data exchange via relations (Q1762192) (← links)
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset (Q2093265) (← links)
- On the hardness of learning queries from tree structured data (Q2343989) (← links)
- Path constraints in semistructured data (Q2456353) (← links)
- On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316) (← links)
- A Rewrite Approach for Pattern Containment (Q3184735) (← links)
- XML Schema Mappings (Q3189647) (← links)