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
Journal of Logic Programming
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
On the web ontology rule language OWL 2 RL
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
WORL: A Web Ontology Rule Language
KSE '11 Proceedings of the 2011 Third International Conference on Knowledge and Systems Engineering
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Hi-index | 0.00 |
The aim of this paper is to analyze the efficiency of the QSQN method, which was proposed by us and Nguyen in [10] for evaluating queries to Horn knowledge bases. In order to compare QSQN with the well-known methods QSQR and the one based on the Magic-Set transformation, we have implemented all of these methods. We compare them using representative examples that appear in many articles on deductive databases. Our experimental results show that the QSQN method usually outperforms the two other methods. Apart from the experimental results, we also explain the reasons behind the good performance of QSQN.