Testing containment of object-oriented conjunctive queries is ∏2p-hard
- 122 Downloads
We study the complexity of testing containment for a class of object-oriented conjunctive queries. We show that the containment problem is ∏ 2 p -hard. Together with a previous result, the containment problem is complete in ∏ 2 p .
KeywordsNormal Form Atomic Type Truth Table Query Optimization Conjunctive Query
Unable to display preview. Download preview PDF.
- Chan, E.P.F., “Complexity of Testing Containment, Equivalence and Minimization of Object-Preserving Conjunctive Queries,” TR-93-36, Department of Computer Science, University of Waterloo, 1993.Google Scholar
- Chan, E.P.F., “Containment and Optimization of Object-Preserving Conjunctive Queries,” TR-94-07, Department of Computer Science, University of Waterloo, 1994. An extended abstract appeared in Proceedings of ACM PODS 1992, pp. 192–202.Google Scholar
- Stockmeyer, L.J. and Meyer, A.R., “Word Problems requiring exponential time,” Proc. of the 5th STOC, pp.1–9, 1973.Google Scholar