On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
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
The generalized counting method for recursive logic queries
Proceedings on International conference on database theory
Bounds on the propagation of selection into logic programs
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
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handling redundancy in the processing of recursive database queries
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Proof-tree transformation theorems and their applications
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Commutativity and its role in the processing of linear recursion
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Argument reduction by factoring
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Hard problems for simple logic programs
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
Efficient Evaluation of Multiple Linear Recursions
IEEE Transactions on Software Engineering
Decomposition of magic rewriting
Journal of the ACM (JACM)
Polynomial-time program transformations in deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An experimental performance study of a pipelined recursive query processing strategy
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
IEEE Transactions on Knowledge and Data Engineering
A Study on the Structure of Linear Recursion
IEEE Transactions on Knowledge and Data Engineering
Factoring Augmented Regular Chain Programs
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper we consider evaluating queries on relations defined by a combination of recursive rules. We first define separable recursions. We then give a specialized algorithm for evaluating selections on separable recursions. Like the Generalized Magic Sets and Generalized Counting algorithms, thus algorithm uses selection constants to avoid examining irrelevant portions of the database, however, on some simple recursions this algorithm is &Ogr;(n), whereas Generalized Magic Sets is &OHgr;(n2) and Generalized Counting is &OHgr;(2n)