Consistency of injective tree patterns

DOI10.4230/LIPICS.FSTTCS.2014.279MaRDI QIDQ2978520zbMATH OpenFDO

Authors Claire David, Nadime Francis, Filip Murlak

Publication date 25 April 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2014.279

zbMATH Keywords

consistencyincomplete informationinjective tree patternsXML

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Trees in trees: is the incomplete information about a tree consistent?
• Complexity of Data Tree Patterns over XML Documents
• Validity of tree pattern queries with respect to schema information
• Reasoning about integrity constraints for tree-structured data
• Reasoning about integrity constraints for tree-structured data

Cited in

(2)

• Trees in trees: is the incomplete information about a tree consistent?
• Check on consistency of tree pattern queries under DTD constraints

This page was built for publication: Consistency of injective tree patterns

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