dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

The Complexity of Evaluating Relational Queries.

Stavros S. Cosmadakis: The Complexity of Evaluating Relational Queries. PODS 1983: 149-155
@inproceedings{DBLP:conf/pods/Cosmadakis83,
  author    = {Stavros S. Cosmadakis},
  editor    = {Ronald Fagin and
               Philip A. Bernstein},
  title     = {The Complexity of Evaluating Relational Queries},
  booktitle = {Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles
               of Database Systems, March 21-23, 1983, Colony Square Hotel,
               Atlanta, Georgia, USA},
  publisher = {ACM},
  year      = {1983},
  isbn      = {0-89791-097-4},
  pages     = {149-155},
  ee        = {http://doi.acm.org/10.1145/588058.588077, db/conf/pods/Cosmadakis83.html},
  crossref  = {DBLP:conf/pods/83},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

We prove a sequence of results which characterize exactly the complexity of problems related to the evaluation of relational queries consisting of projections and natural joins. We show that testing whether the result of a given query on a given relation equals some other given relation is DP complete (DP is a class which includes both NP and co-NP, and was recently introduced in a totally different context [13]). We show that testing inclusion or equivalence of queries with respect to a fixed relation (or of relations with respect to a fixed query) is Pi2p-complete. We also examine the complexity of estimating the number of tuples of the answer.

Copyright © 1983 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ...

Printed Edition

Ronald Fagin, Philip A. Bernstein (Eds.): Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 21-23, 1983, Colony Square Hotel, Atlanta, Georgia, USA. ACM 1983, ISBN 0-89791-097-4
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Online Edition: ACM Digital Library


References

[1]
Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
...
[3]
Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
E. F. Codd: A Relational Model of Data for Large Shared Data Banks. Commun. ACM 13(6): 377-387(1970) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
E. F. Codd: Relational Completeness of Data Base Sublanguages. In: R. Rustin (ed.): Database Systems: 65-98, Prentice Hall and IBM Research Report RJ 987, San Jose, California : (1972) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
Stephen A. Cook: The Complexity of Theorem-Proving Procedures. STOC 1971: 151-158 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
Richard A. DeMillo, Richard J. Lipton: The Consistency of "P = NP" and Related Problems with Fragments of Number Theory. STOC 1980: 45-57 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
Peter Honeyman: Extension Joins. VLDB 1980: 239-244 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[10]
Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis: Testing the Universal Instance Assumption. Inf. Process. Lett. 10(1): 14-19(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
...
[12]
David Maier, Yehoshua Sagiv, Mihalis Yannakakis: On the Complexity of Testing Implications of Functional and Join Dependencies. J. ACM 28(4): 680-695(1981) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[13]
Christos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Facets (and Some Facets of Complexity). STOC 1982: 255-260 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
Larry J. Stockmeyer: The Polynomial-Time Hierarchy. Theor. Comput. Sci. 3(1): 1-22(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[15]
Yehoshua Sagiv, Mihalis Yannakakis: Equivalences Among Relational Expressions with the Union and Difference Operators. J. ACM 27(4): 633-655(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
Leslie G. Valiant: The Complexity of Computing the Permanent. Theor. Comput. Sci. 8: 189-201(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[17]
Leslie G. Valiant: The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8(3): 410-421(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[18]
Celia Wrathall: Complete Sets and the Polynomial-Time Hierarchy. Theor. Comput. Sci. 3(1): 23-33(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[19]
Mihalis Yannakakis: Algorithms for Acyclic Database Schemes. VLDB 1981: 82-94 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Last update Fri Sep 14 17:28:23 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page