Foundations of logic programming
Foundations of logic programming
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Convergence of sideways query evaluation
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance evaluation of data intensive logic programs
Foundations of deductive databases and logic programming
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Argument reduction by factoring
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Towards an open architecture for LDL
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Functional dependencies in Horn clause queries
ACM Transactions on Database Systems (TODS)
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
Learning efficient query processing strategies
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementation of the CORAL deductive database system
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Space optimization in deductive databases
ACM Transactions on Database Systems (TODS)
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
DECLARE and SDS: early efforts to commercialize deductive database technology
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
A New Formulation of Tabled Resolution with Delay
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
How to Forget the Past Without Repeating It
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Optimizing existential queries in stratifiable deductive databases
Proceedings of the 2005 ACM symposium on Applied computing
The complexity of theory revision
Artificial Intelligence
| Hi-index | 0.00 |
The problem of pushing projections in recursive rules has received little attention. The objective of this paper is to motivate this problem and present some (partial) solutions. We consider programs with function-free rules, also known as Datalog programs. After formally defining existential subqueries, we present a syntactic criterion for detecting them and then consider optimization in three areas 1) We identify the existential subqueries and make them explicit by rewriting the rules. This, in effect, automatically captures some aspects of Prolog's cut operator that are appropriate to the bottom-up model of computation 2) We eliminate argument positions in recursive rules by “pushing projections” 3) We observe that “pushing projections” in rules also has the effect of making some rules (even recursive rules) redundant and try to (identify and) discard them