Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons

DOI10.1016/j.ipl.2016.12.005zbMath1400.68066OpenAlexW2563541764MaRDI QIDQ506166

Maarten Marx, Evgeny Sherkhonov

Publication date: 31 January 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:aeab0f9a-cc3d-468e-9756-15a93bd6048c

zbMATH Keywords

conjunctive querydatabasesquery containment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Cites Work

• Unnamed Item
• Structural properties of XPath fragments
• The complexity of querying indefinite data about linearly ordered domains
• Hypertree decompositions and tractable queries
• Information integration using logical views
• Conjunctive query containment revisited
• Tree pattern query minimization
• On the complexity of tree pattern containment with arithmetic comparisons
• Containment for Conditional Tree Patterns
• Degrees of acyclicity for hypergraphs and relational database schemes
• The complexity of acyclic conjunctive queries
• On conjunctive queries containing inequalities
• Containment and equivalence for a fragment of XPath

This page was built for publication: Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons