On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A decidable class of bounded recursions
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
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Compiling separable recursions
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Classification of recursive formulas in deductive databases
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Minimizing function-free recursive inference rules
Journal of the ACM (JACM)
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Compiling general linear recursions by variable connection graph analysis
Computational Intelligence
Recursive query processing based on program structure
Methodologies for intelligent systems, 5
Efficient Evaluation of Multiple Linear Recursions
IEEE Transactions on Software Engineering
Characterization and processing of simple prefixed-chain recursion
Information Sciences: an International Journal
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
Logic Approaches for Deductive Databases
IEEE Expert: Intelligent Systems and Their Applications
Proceedings of the Fifth International Conference on Data Engineering
Fast Query Processing in Deductive Databases
IEEE Software
| Hi-index | 0.00 |
We study a general class of single linear recursions and the properties of their expansions by analyzing the structures of the recursions. We show that the expansions of a linear recursion of this class are very regular in that the variable connections are heavily shared and change periodically with respect to the expansions. The variable connections can be precisely characterized as static bindings and chain connections. We conclude that a single linear recursion under our assumptions either is bounded or can be expressed as chain recursions. This study contributes to query processing, because it provides the basis for rule compilation as a general and powerful technique for query processing. Combined with query information, the expansion properties of the recursion provide optimized query-processing plans.