On the complexity of tree pattern containment with arithmetic comparisons
From MaRDI portal
Publication:1944129
DOI10.1016/J.IPL.2011.04.014zbMATH Open1260.68134OpenAlexW1977010044MaRDI QIDQ1944129FDOQ1944129
Authors: Foto N. Afrati, Sara Cohen, Gabriel M. Kuper 
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.04.014
Recommendations
Cites Work
- Title not available (Why is that?)
- The complexity of query containment in expressive fragments of XPath 2.0
- XPath satisfiability in the presence of DTDs
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- Containment and equivalence for a fragment of XPath
- The complexity of querying indefinite data about linearly ordered domains
- On conjunctive queries containing inequalities
- XML queries and constraints, containment and reformulation
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Complexity of Data Tree Patterns over XML Documents
- Title not available (Why is that?)
- Rewriting queries using views in the presence of arithmetic comparisons
Cited In (7)
- Patterns with Bounded Treewidth
- Title not available (Why is that?)
- Containment for conditional tree patterns
- Conjunctive query containment over trees
- Least common container of tree pattern queries and its applications
- Validity of tree pattern queries with respect to schema information
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
Uses Software
This page was built for publication: On the complexity of tree pattern containment with arithmetic comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944129)
