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
The Alexander method-a technique for the processing of recursive axioms in deductive databases
New Generation Computing
Recursive query processing: the power of logic
Theoretical Computer Science
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An abstract machine for tabled execution of fixed-order stratified logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient fixpoint computation in linear tabling
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Linear tabulated resolution based on Prolog control strategy
Theory and Practice of Logic Programming
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
On the efficiency of query-subquery nets: an experimental point of view
Proceedings of the Fourth Symposium on Information and Communication Technology
| Hi-index | 0.00 |
We formulate query-subquery nets and use them to create the first framework for developing algorithms for evaluating queries to Horn knowledge bases with the properties that: the approach is goal-directed; each subquery is processed only once and each supplement tuple, if desired, is transferred only once; operations are done set-at-a-time; and any control strategy can be used. Our intention is to increase efficiency of query processing by eliminating redundant computation, increasing flexibility and reducing the number of accesses to the secondary storage. The framework forms a generic evaluation method called QSQN. To deal with function symbols, we use a term-depth bound for atoms and substitutions occurring in the computation and propose to use iterative deepening search which iteratively increases the term-depth bound. In the long version [6] of the current paper we prove soundness and completeness of our generic evaluation method and show that, when the term-depth bound is fixed, the method has PTIME data complexity. In [6] we also propose two exemplary control strategies: one is to reduce the number of accesses to the secondary storage, while the other is depth-first search.