Expressive Power of Query Languages**Authors addresses: Serge Abiteboul, INRIA, B.P. 105, 78153 Le Chesnay CEDEX, France (abitebou@inria.inria.fr); Victor Vianu, CSE 0114, U.C. San Diego, La Jolla, CA 92093-0114, USA (vianu@cs.ucsd.edu). Work supported in part by an INRIA-NSF cooperation grant, by the French Ministry of Research under grant PRC-BD3 and the National Science Foundation under grants IRI-8816078 and INT-8817874. Work performed in part while the second author was visiting INRIA.
- 1 January 1992
- book chapter
- Published by Elsevier
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Fixpoint extensions of first-order logic and datalog-like languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On Datalog vs. polynomial time (extended abstract)Published by Association for Computing Machinery (ACM) ,1991
- Generic Computation and its complexityPublished by Association for Computing Machinery (ACM) ,1991
- Finite-model theory—a personal perspectivePublished by Springer Nature ,1990
- Object identity as a query language primitivePublished by Association for Computing Machinery (ACM) ,1989
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976