Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1995: Computing and Combinatorics pp 81–90Cite as

Testing containment of object-oriented conjunctive queries is ∏ p2 -hard

  • Session 2B: Database
  • Conference paper
  • First Online:

  • 140 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Abstract

We study the complexity of testing containment for a class of object-oriented conjunctive queries. We show that the containment problem is ∏ p2 -hard. Together with a previous result, the containment problem is complete in ∏ p2 .

Part of this work was done while the author visited NTT Basic Research Laboratories in Tokyo.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chan, E.P.F., “Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries,” Theoretical Computer Science (134), pp. 287–309, 1994.

    Article  Google Scholar 

  2. 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 

  3. 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 

  4. Stockmeyer, L.J. and Meyer, A.R., “Word Problems requiring exponential time,” Proc. of the 5th STOC, pp.1–9, 1973.

    Google Scholar 

  5. Wrathall, C., “Complete Sets and the Polynomial-time Hierarchy,” Theoretical Computer Science (3), pp. 23–33, 1976.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Edward P. F. Chan

  2. Information Science Laboratory, NTT Basic Research Laboratories, Atsugi-shi, 243-01, Kanagawa, Japan

    Ron van der Meyden

Authors
  1. Edward P. F. Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ron van der Meyden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, E.P.F., van der Meyden, R. (1995). Testing containment of object-oriented conjunctive queries is ∏ p2 -hard. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030822

Download citation

  • DOI: https://doi.org/10.1007/BFb0030822

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation