"Magic Set Computation for Stratified Databases," I. Balbin, G.S. Port and K. Ramamohanarao, Dept. of Computer Science, University of Melbourne, Australia, TR 87/3. -- -- - 36 - Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On the Power of Magic - Beeri, Ramakrishnan (1987) (102 citations) (Correct)
....r can be deleted unless it corresponds to p h . The intuition is that the magic literal in the rules defining a predicate q a already achieves the restriction that is obtained by adding the corresponding magic predicate to an occurrence of q a . The rewriting algorithm is simplified in [Balbin et al. 87] by not introducing any of the redundant magic predicates. 5. Generalized Supplementary Magic Sets The Generalized Magic Sets algorithm for rewriting a set of adorned rules succeeds in implementing a given set of sips, but it suffers from the drawback that many facts are evaluated repeatedly. If ....
"Magic Set Computation for Stratified Databases," I. Balbin, G.S. Port and K. Ramamohanarao, Dept. of Computer Science, University of Melbourne, Australia, TR 87/3. -- -- - 36 -
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC