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...
Saved in:
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 http://psasir.upm.edu.my/id/eprint/49444/ http://e-journal.um.edu.my/publish/MJCS/132-146# |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.upm.eprints.49444 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.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# |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
language |
English |
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. |
format |
Article |
author |
Mamat, Ali Mat Deris, Mustafa |
spellingShingle |
Mamat, Ali Mat Deris, Mustafa An effect of simplifying magic rules for answering recursive queries in deductive databases |
author_facet |
Mamat, Ali Mat Deris, Mustafa |
author_sort |
Mamat, Ali |
title |
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_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_sort |
effect of simplifying magic rules for answering recursive queries in deductive databases |
publisher |
Faculty of Computer Science and Information Technology, University of Malaya |
publishDate |
1997 |
url |
http://psasir.upm.edu.my/id/eprint/49444/1/An%20effect%20of%20simplifying%20magic%20rules%20for%20answering%20recursive%20queries%20in%20deductive%20databases.pdf http://psasir.upm.edu.my/id/eprint/49444/ http://e-journal.um.edu.my/publish/MJCS/132-146# |
_version_ |
1643834368807927808 |
score |
13.211869 |