"On Compiling Queries in Recursive First-Order Data Bases," L. Henschen and S. Naqvi, JACM, Vol 31, January 1984, pp 47-85.  Home/Search   Document Not in Database   Summary   Related Articles

....are passed from the rule s head to the base predicate par. The values obtained by evaluating 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 ....

....queries, or facts, in addition to those that must be generated by conditions 1 and 2, and then we have good reason to consider it inferior to the Generalized Magic Sets strategy. We remark that there exist methods in the literature that are sometimes better than Generalized Magic (e.g. Chang 81, Henschen and Naqvi 84] in terms of the number of distinct facts generated. These usually work only for certain classes of programs, and do not proceed by invoking subgoals using the program rules and sips. Utilizing special knowledge about the form of rules, these methods do not follow the rules, but rather, use ....

"On Compiling Queries in Recursive First-Order Data Bases," L. Henschen and S. Naqvi, JACM, Vol 31, January 1984, pp 47-85.

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