The complexity of evaluating relational queries
- 30 September 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 58 (1-3), 101-112
- https://doi.org/10.1016/s0019-9958(83)80059-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Complexity of Testing Implications of Functional and Join DependenciesJournal of the ACM, 1981
- Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM, 1980
- Testing the universal instance assumptionInformation Processing Letters, 1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970