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)
On the implementation of a simple class of logic queries for databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Naive evaluation of recursively defined relations
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
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
Evaluation of database recursive logic programs as recurrent function series
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
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
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
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Handling redundancy in the processing of recursive database queries
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A study of transitive closure as a recursion mechanism
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
Foundations of semantic query optimization for deductive databases
Foundations of deductive databases and logic programming
Linearization of Nonlinear Recursive Rules
IEEE Transactions on Software Engineering
Moving Selections into Linear Least Fixpoint Queries
Proceedings of the Fourth International Conference on Data Engineering
An Optimization Strategy for Recursive Queries in Logic Databases
Proceedings of the Fourth International Conference on Data Engineering
Some Performance Results on Recursive Query Processing in Relational Database Systems
Proceedings of the Second International Conference on Data Engineering
Efficient Recursive Query Processing using Wavefront Methods
Proceedings of the Third International Conference on Data Engineering
Translation and Optimization of Logic Queries: The Algebraic Approach
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Parallel Processing Strategy for Evaluating Recursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A linearization of non-linear recursive programs in logic databases
A linearization of non-linear recursive programs in logic databases
Theory of Relational Databases
Theory of Relational Databases
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
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
Linearisability on datalog programs
Theoretical Computer Science
Generalization of ZYT-linearizability for bilinear datalog programs
Information and Computation
Generating Specialized Rules and Programs for Demand-Driven Analysis
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
Linearization of nonlinear recursive programs is an important issue in logic databases for both practical and theoretical reasons. If a nonlinear recursive program can be transformed into an equivalent linear recursive program, then it may be computed more efficiently than when the tranformation is not possible. We provide a set of necessary and sufficient conditions for a simple doubly recursive program to be equivalent to a simple linear recursive program. The necessary and sufficient conditions can be verified effectively.