Validity of tree pattern queries with respect to schema information

DOI10.1007/978-3-642-40313-2_17zbMATH Open1398.68187OpenAlexW139189943MaRDI QIDQ2849907FDOQ2849907

Authors: Henrik Björklund, Wim Martens, Thomas Schwentick 

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_17

Recommendations

• Conjunctive query containment over trees using schema information
• Optimizing Conjunctive Queries over Trees Using Schema Information
• Complexity of Data Tree Patterns over XML Documents
• On the complexity of tree pattern containment with arithmetic comparisons
• Conjunctive query containment over trees

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Cited In (10)

• On the complexity of tree pattern containment with arithmetic comparisons
• Least common container of tree pattern queries and its applications
• Closest substring problems for regular languages
• Consistency of injective tree patterns
• Title not available (Why is that?)
• Conjunctive query containment over trees using schema information
• Schemas for unordered XML on a DIME
• Optimizing Conjunctive Queries over Trees Using Schema Information
• A revised result on chasing tree patterns under schema graphs
• Check on consistency of tree pattern queries under DTD constraints

This page was built for publication: Validity of tree pattern queries with respect to schema information

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