Structure and complexity of relational queries
- 31 August 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (1) , 99-128
- https://doi.org/10.1016/0022-0000(82)90012-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Programming primitives for database languagesPublished by Association for Computing Machinery (ACM) ,1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- The diversity of quantifier prefixesThe Journal of Symbolic Logic, 1973
- A relational model of data for large shared data banksCommunications of the ACM, 1970