Efficient bottom-up computation of queries on stratified databases
- 30 November 1991
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 11 (3-4) , 295-344
- https://doi.org/10.1016/0743-1066(91)90030-s
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Counting methods for cyclic relationsPublished by Association for Computing Machinery (ACM) ,1988
- A generalization of the differential approach to recursive query evaluationThe Journal of Logic Programming, 1987
- On the power of magicPublished by Association for Computing Machinery (ACM) ,1987
- Sets and negation in a logic data base language (LDL1)Published by Association for Computing Machinery (ACM) ,1987
- A basis for deductive database systems IIThe Journal of Logic Programming, 1986
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Logic for improving integrity checking in relational data bases?Acta Informatica, 1982