On the complexity of tree pattern containment with arithmetic comparisons

DOI10.1016/j.ipl.2011.04.014zbMath1260.68134OpenAlexW1977010044MaRDI QIDQ1944129

Foto N. Afrati, Sara A. 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

zbMATH Keywords

databasesquery containmenttree patternsarithmetic comparisonsXPath queries

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• XML queries and constraints, containment and reformulation
• The complexity of querying indefinite data about linearly ordered domains
• Rewriting queries using views in the presence of arithmetic comparisons
• The complexity of query containment in expressive fragments of XPath 2.0
• XPath satisfiability in the presence of DTDs
• Optimizing Conjunctive Queries over Trees Using Schema Information
• Complexity of Data Tree Patterns over XML Documents
• On conjunctive queries containing inequalities
• On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
• Containment and equivalence for a fragment of XPath

This page was built for publication: On the complexity of tree pattern containment with arithmetic comparisons