S. Cosmadakis. The Complexity of Evaluating Relational Queries. Information and Control, 58:101--112, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Data Exchange: Getting to the Core - Fagin, Kolaitis, Popa (2003) (2 citations) (Correct)
....out to be DP complete (see [18] For instance, CRITICAL SAT is DP complete, where an instance of this problem is a CNF formula and the question is to determine whether is unsatisfiable, but if any one of its clauses is removed, then the resulting formula is satisfiable. Moreover, Cosmadakis [5] showed that certain problems related to database query evaluation are DP complete. Note that DP contains both NP and coNP as subclasses; furthermore, each DP complete problem is both NP hard and coNP hard. The prevailing belief in computational complexity is that the above containments are ....
S. Cosmadakis. The Complexity of Evaluating Relational Queries. Information and Control, 58:101--112, 1983.
On the Representation and Querying of Sets of Possible.. - Abiteboul, Kanellakis.. (1989) (38 citations) (Correct)
....range of second order queries on incomplete information databases. Our results refine and extend both [V2] and [IL] A less realistic alternative (which we do not pursue here) is to let the query program size be part of the input size. Then the complexity of evaluation increases exponentially [Cos, V1]. This increase is due to a certain incompleteness of relational algebra with respect to the algebra of polynomials [Cos] Such problems were first noted in [HLY, MSY] as part of the study of nulls in weak universal instances. Data complexity avoids these anomalies, by factoring out the query ....
....realistic alternative (which we do not pursue here) is to let the query program size be part of the input size. Then the complexity of evaluation increases exponentially [Cos, V1] This increase is due to a certain incompleteness of relational algebra with respect to the algebra of polynomials [Cos]. Such problems were first noted in [HLY, MSY] as part of the study of nulls in weak universal instances. Data complexity avoids these anomalies, by factoring out the query program representation and maintaining only the combinatorics of the uncertainty in the database. Section 2 contains a ....
Cosmadakis, S.S., "The Complexity of Evaluating Relational Queries", Information and Control, vol. 58, pp. 101--112, 1983.
Data Exchange: Getting to the Core - Ronald Fagin Ibm (2003) (2 citations) (Correct)
No context found.
S. Cosmadakis. The Complexity of Evaluating Relational Queries. Information and Control, 58:101--112, 1983.
Data Exchange: Getting to the Core - Ronald Fagin Ibm (2003) (2 citations) (Correct)
No context found.
S. Cosmadakis. The Complexity of Evaluating Relational Queries. Information and Control, 58:101--112, 1983. 33
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC