On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
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
A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule
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
Compiling separable recursions
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Compiling general linear recursions by variable connection graph analysis
Computational Intelligence
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient Evaluation of Multiple Linear Recursions
IEEE Transactions on Software Engineering
LogicBase: a deductive database system prototype
CIKM '94 Proceedings of the third international conference on Information and knowledge management
IEEE Transactions on Knowledge and Data Engineering
Constraint-Based Query Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
A Study on the Structure of Linear Recursion
IEEE Transactions on Knowledge and Data Engineering
Efficient Query Processing for a Subset of Linear Recursive Binary Rules
IEEE Transactions on Knowledge and Data Engineering
Linearizing Some Recursive Logic Programs
IEEE Transactions on Knowledge and Data Engineering
Chain-Split Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The authors study the compilation and efficient processing of asynchronous chain recursions and show that many complex function-free recursions, which may contain single or multiple linear recursive rules, nonlinear recursive rules, mutually recursive rules, and multiple-level recursions, can be compiled to asynchronous chain recursions. The study on the compilation methods, the simplification of compiled formulas, and the query-processing techniques shows that asynchronous chain recursions can be compiled to relatively simple compiled formulas and processed efficiently using transitive closure query-processing methods.