"The Generalized Counting Method for Recursive Logic Queries," D. Sacca and C. Zaniolo, Proc. First International Conference on Database Theory, 1986. 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)
....that the index fields may grow indefinitely for example, if the data contains cycles. In this section, we present some sufficient conditions for recognizing that the bottom up evaluation of a rewritten set of rules is safe. We first present a generalization of the safety condition described in [Sacca and Zaniolo 86b] The binding graph of a query is defined to be a directed graph whose nodes are adorned predicates p a . We draw an arc [r i , j] from p 1 a 1 to p 2 a 2 if p 1 a 1 is the head of the ith adorned rule and p 2 a 2 is the jth predicate in the body. The root of the graph is the query ....
"The Generalized Counting Method for Recursive Logic Queries," D. Sacca and C. Zaniolo, Proc. First International Conference on Database Theory, 1986.
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