Minimization of tree patterns

DOI10.1145/3180281MaRDI QIDQ4625647zbMATH OpenOpenAlexWikidataFDO

Authors Wojciech Czerwiński, Wim Martens, Matthias Niewerth, Paweł Parys

Publication date 25 February 2019

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3180281

zbMATH Keywords

complexitygraph databasesgraphsoptimizationpattern matchingtree patternstreesXMLXPath

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Tree pattern query minimization
• Least common container of tree pattern queries and its applications
• On the minimization of XPath queries
• Learning Tree Patterns from Example Graphs
• The Complexity of Learning Tree Patterns from Example Graphs

Cited in

(6)

• Tree size reduction with keeping distinguishability
• Conjunctive query containment over trees using schema information
• Tree pattern query minimization
• Minimum-Entropy Tree Structures with a Given Terminal Node Assignment
• A revised result on chasing tree patterns under schema graphs
• Learning tree pattern transformations

This page was built for publication: Minimization of tree patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625647)