Least common container of tree pattern queries and its applications

DOI10.1007/S00236-012-0155-1zbMATH Open1251.68093OpenAlexW1987990367MaRDI QIDQ715041FDOQ715041

Jeffrey Xu Yu, Chengfei Liu, Junhu Wang, Chaoyi Pang

Publication date: 15 October 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-012-0155-1

Recommendations

• A Rewrite Approach for Pattern Containment
• Containment for conditional tree patterns
• On the complexity of tree pattern containment with arithmetic comparisons
• Rewriting XPath queries using materialized XPath views
• Validity of tree pattern queries with respect to schema information

zbMATH Keywords

maximal contained rewriting of a tree pattern

Mathematics Subject Classification ID

Trees (05C05) Database theory (68P15)

Cites Work

• The complexity of query containment in expressive fragments of XPath 2.0
• On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
• Containment and equivalence for a fragment of XPath
• Structural properties of XPath fragments
• Tree pattern query minimization
• Title not available (Why is that?)

Uses Software

• XPath

This page was built for publication: Least common container of tree pattern queries and its applications

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