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
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A logical language for data and knowledge bases
A logical language for data and knowledge bases
Substitution-based compilation of extended rules in deductive databases
CADE-10 Proceedings of the tenth international conference on Automated deduction
Semantics and properties of existential quantifiers in deductive databases
Information Processing Letters
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Pattern-based and knowledge-directed query compilation for recursive data bases (expert, systems, reductive, logic)
Extending the expressive power of deductive databases
Extending the expressive power of deductive databases
A Logic Database System with Extended Functionality
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
| Hi-index | 0.00 |
In order to extend the expressive power of deductive databases, a formula that can have existential quantifiers in prenex normal form in a restricted way is defined as an extended rule. With the extended rule, we can easily define a virtual view that requires a division operation of relational algebra to evaluate. This paper addresses a recursive query evaluation where at least one formula in a recursive rule set is of an extended rule. We investigate transformable recursions as well as four cases of non-transformable recursions of transitive-closure-like and linear type. This work reveals that occurrence of an existentially quantified variable in the extended recursive body predicate might dramatically limit the level of recursive search. In particular, the number of iterations to answer extended queries can be determined, independently of database contents.