Tree pattern query minimization
From MaRDI portal
Publication:1811333
DOI10.1007/s00778-002-0076-7zbMath1047.68040OpenAlexW2068157134MaRDI QIDQ1811333
Sihem Amer-Yahia, Divesh Srivastava, SungRan Cho, Laks V. S. Lakshmanan
Publication date: 2002
Published in: The VLDB Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00778-002-0076-7
Related Items (16)
Tree size reduction with keeping distinguishability ⋮ A Rewrite Approach for Pattern Containment ⋮ XML Schema Mappings ⋮ Solutions in XML data exchange ⋮ On the Complexity of Extracting Subtree with Keeping Distinguishability ⋮ Schemas for unordered XML on a DIME ⋮ Rewriting XPath queries using materialized XPath views ⋮ Path constraints in semistructured data ⋮ Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons ⋮ Numerical constraints on XML data ⋮ Efficient inclusion for a class of XML types with interleaving and counting ⋮ Tractable XML data exchange via relations ⋮ Least common container of tree pattern queries and its applications ⋮ Deciding equivalence of top-down XML transformations in polynomial time ⋮ Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset ⋮ On the hardness of learning queries from tree structured data
This page was built for publication: Tree pattern query minimization
