| J. Rohmer, R. Lescoeur. La Methode Alexandre une solution pour traiter les axiomes recursifs dons les bases de donnees deductives. Colloque Reconnaissances de Forme et Intelligence Artificielle, Grenoble, 1985 |
....par with these bindings are then passed to anc, to generate yet another subgoal. Several strategies have been proposed for evaluating recursive queries expressed using sets of Horn Clauses (rules) Henschen and Naqvi 84] Kifer and Lozinskii 85] Lozinskii 85] McKay and Shapiro 81] Rohmer and Lescoeur 85] Sacca and Zaniolo 86a] Van Gelder 86] Vieille 86] etc. See [Bancilhon and Ramakrishnan 86] for a comprehensive survey. The main thrust of the above strategies is to improve efficiency by restricting the computation to tuples that are related to the query. They all use information passing ....
....case, and that the seed for q i a i (c i ) can be obtained by first generating supmagic i r (d) where d is a vector of constants, and then using the auxiliary rule magic q i a ( supmagic i r ( to generate the required seed magic q i a i . The Alexander strategy, described in [Rohmer and Lescoeur 85] is essentially the Generalized Supplementary Magic Sets strategy, although they only consider Datalog. 6. Generalized Counting Counting is a further elaboration on the theme of restricting the search by auxiliary predicates. Using magic predicates, we were able to restrict the invocation of a ....
"La Methode Alexandre: une solution pour traiter les axiomes recursifs dans les bases de donnees deductives ," Rohmer and Lescoeur, Colloque Reconnaissance de Formes et Intelligence Artificielle, Grenoble, November 1985.
No context found.
J. Rohmer, R. Lescoeur. La Methode Alexandre une solution pour traiter les axiomes recursifs dons les bases de donnees deductives. Colloque Reconnaissances de Forme et Intelligence Artificielle, Grenoble, 1985
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