Testing containment of object-oriented conjunctive queries is ∏2p-hard

DOI10.1007/BFB0030822MaRDI QIDQ6064017zbMATH OpenOpenAlexFDO

Authors Edward P. F. Chan, Ron van der Meyden

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0030822

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1951561
• Containment and Optimization of Object-Preserving Conjunctive Queries
• Testing satisfiability of a class of object-oriented conjunctive queries
• Conjunctive query containment with respect to views and constraints
• On the containment problem for queries in conjunctive form with negation

Cites work

• Complete sets and the polynomial-time hierarchy
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)

This page was built for publication: Testing containment of object-oriented conjunctive queries is ∏2p-hard

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