Data independent recursion in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Foundations of deductive databases and logic programming
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Preservation of integrity constraints in definite DATALOG programs
Information Processing Letters
Linearization-based query optimization in datalog
Linearization-based query optimization in datalog
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
SQL:1999: understanding relational language components
SQL:1999: understanding relational language components
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Theory of Relational Databases
Theory of Relational Databases
| Hi-index | 0.00 |
After two decades of research in Deductive Databases, SQL99 brings deductive databases again to the foreground given that SQL99 includes queries with linear recursion. However, the execution of recursive queries may result in slow response time, thus the research in query optimization is very important to provide the suitable algorithms that will be included in the query optimizers of the database management systems in order to speed up the execution of recursive queries. We use a semantic query optimization approach in order to improve the efficiency of the evaluation of datalog programs. Our main contribution is an algorithm that builds a program P驴 equivalent to a given program P, when both are applied over a database d satisfying a set of functional dependencies. The input program P is a linear recursive datalog program. The new program P驴 has less number of different variables and, sometimes, less number of atoms in the recursive rules, thus it is cheaper to evaluate.