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)
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
Data independent recursion in deductive databases
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
A classification of recursive formulas in deductive databases
A classification of recursive formulas in deductive databases
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Pattern-based and knowledge-directed query compilation for recursive data bases (expert, systems, reductive, logic)
An annotated bibliography on object-orientation and deduction
ACM SIGMOD Record
Optimization of relational algebra expressions containing recursion operators
CSC '91 Proceedings of the 19th annual conference on Computer Science
Classification and Compilation of Linear Recursive Queries 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
| Hi-index | 0.00 |
In this paper, we present results on the classification of linear recursive formulas in deductive databases and apply those results to the compilation and optimization of recursive queries. We also introduce compiled formulas and query evaluation plans for a representative query for each of these classes.To explain general recursive formulas, we use a graph model that shows the connectivity between variables. The connecticity between variables is the most critical part in processing recursive formulas. We demonstrate that based on such a graph model all the linear recursive formulas can be classified into several classes and each class shares some common characteristics in compilation and query processing. The compiled formulas and the corresponding query evaluation plans can be derived based on the study of the compilation of each class.