An Effect of Simplifying Magic Rules For Answering Recursive Queries in Deductive Databases

Main Article Content

Ali Mamat
Mustafa Mat Deris

Abstract

The basic magic sets transformation algorithm for rewriting logical rules in deductive databases is very clear and straightforward. However, rules generated by the algorithm for answering queries are too many compared to the original rules. Therefore, it is useful to simplify the generated rules before they are evaluated. This paper reports the study on the effect of simplifying such rules from the aspect of computing time. It is concluded that the improvement as a result of simplification is quite significant.

Downloads

Download data is not yet available.

Article Details

How to Cite
Mamat, A., & Mat Deris, M. (1997). An Effect of Simplifying Magic Rules For Answering Recursive Queries in Deductive Databases. Malaysian Journal of Computer Science, 10(1), 47–52. Retrieved from https://ijps.um.edu.my/index.php/MJCS/article/view/3015
Section
Articles