An effect of simplifying magic rules for answering recursive queries in deductive databases
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 bef...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Information Technology, University of Malaya
1997
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/49444/1/An%20effect%20of%20simplifying%20magic%20rules%20for%20answering%20recursive%20queries%20in%20deductive%20databases.pdf |
| Summary: | 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. |
|---|