Efficient evaluation for a subset of recursive queries
- 1 June 1987
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 284-293
- https://doi.org/10.1145/28659.28690
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- An amateur's introduction to recursive query processing strategiesACM SIGMOD Record, 1986
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- Evaluating Relational Expressions with Dense and Sparse ArgumentsSIAM Journal on Computing, 1977
- Operations on sparse relationsCommunications of the ACM, 1977