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/ http://psasir.upm.edu.my/id/eprint/49444/1/An%20effect%20of%20simplifying%20magic%20rules%20for%20answering%20recursive%20queries%20in%20deductive%20databases.pdf |
| _version_ | 1848851269580488704 |
|---|---|
| author | Mamat, Ali Mat Deris, Mustafa |
| author_facet | Mamat, Ali Mat Deris, Mustafa |
| author_sort | Mamat, Ali |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T10:19:30Z |
| format | Article |
| id | upm-49444 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:19:30Z |
| publishDate | 1997 |
| publisher | Faculty of Computer Science and Information Technology, University of Malaya |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-494442016-12-30T02:49:36Z http://psasir.upm.edu.my/id/eprint/49444/ An effect of simplifying magic rules for answering recursive queries in deductive databases Mamat, Ali Mat Deris, Mustafa 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. Faculty of Computer Science and Information Technology, University of Malaya 1997 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/49444/1/An%20effect%20of%20simplifying%20magic%20rules%20for%20answering%20recursive%20queries%20in%20deductive%20databases.pdf Mamat, Ali and Mat Deris, Mustafa (1997) An effect of simplifying magic rules for answering recursive queries in deductive databases. Malaysian Journal of Computer Science, 10 (1). pp. 47-52. ISSN 0127-9084 http://e-journal.um.edu.my/publish/MJCS/132-146# |
| spellingShingle | Mamat, Ali Mat Deris, Mustafa An effect of simplifying magic rules for answering recursive queries in deductive databases |
| title | An effect of simplifying magic rules for answering recursive queries in deductive databases |
| title_full | An effect of simplifying magic rules for answering recursive queries in deductive databases |
| title_fullStr | An effect of simplifying magic rules for answering recursive queries in deductive databases |
| title_full_unstemmed | An effect of simplifying magic rules for answering recursive queries in deductive databases |
| title_short | An effect of simplifying magic rules for answering recursive queries in deductive databases |
| title_sort | effect of simplifying magic rules for answering recursive queries in deductive databases |
| url | http://psasir.upm.edu.my/id/eprint/49444/ http://psasir.upm.edu.my/id/eprint/49444/ http://psasir.upm.edu.my/id/eprint/49444/1/An%20effect%20of%20simplifying%20magic%20rules%20for%20answering%20recursive%20queries%20in%20deductive%20databases.pdf |