Polynomial-time program transformations in deductive databases
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 132-144
- https://doi.org/10.1145/298514.298551
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Linearising nonlinear recursions in polynomial timePublished by Association for Computing Machinery (ACM) ,1989
- Compiling separable recursionsPublished by Association for Computing Machinery (ACM) ,1988
- On the power of magicPublished by Association for Computing Machinery (ACM) ,1987
- On the implementation of a simple class of logic queries for databasesPublished by Association for Computing Machinery (ACM) ,1985
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Optimizing Conjunctive Queries that Contain Untyped VariablesSIAM Journal on Computing, 1983
- Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM, 1980
- Efficient optimization of a class of relational expressionsACM Transactions on Database Systems, 1979
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976