On the first-order expressibility of recursive queries
- 29 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 311-323
- https://doi.org/10.1145/73721.73752
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Bounds on the propagation of selection into logic programsPublished by Association for Computing Machinery (ACM) ,1987
- Relational queries computable in polynomial timeInformation and Control, 1986
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- On the foundations of the universal relation modelACM Transactions on Database Systems, 1984
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Properties of almost all graphs and complexesJournal of Graph Theory, 1979