F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM Symposium on Principles of Database Systems, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Soft Stratification for Magic Set Based Query Evaluation .. - Andreas Behrend.. (Correct)
....in combination with the concept weak stratification, however, may lead to a set of answers which is neither sound nor complete with respect to the well founded model. This problem is cured by introducing the new concept soft stratification instead. 1. INTRODUCTION The Magic Sets rewriting [3, 5] technique for query evaluation seems to be the most promising approach to evaluating database queries for database systems with a powerful view concept. This is in particular the case for systems which will implement the new SQL:1999 standard, and hence will allow the definition of recursive ....
Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J. D.: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-16.
Modelling Prolog Control - Roberto Barbuti Michael (1992) (9 citations) (Correct)
....reflects the required control. The key idea is to enhance a program P by a transformation M so that the standard meaning of M (P) reflects the control information required for the analysis of P . So for example, the declarative meaning of a logic program P enhanced by a magic set transformation [4] is shown to reflect the call patterns of P enabling bottom up analysis (e.g. 5, 10, 20] The approach of modelling control has two main advantages: 1) the standard se mantics is not required to be extended to a collecting semantics; and (2) any of the alternative semantic definitions for a ....
F. Bancilhon, D. Maier, Y. Sagiv, J. D, Ullman. Magic Sets and Other Strange Ways to Implement Logic Programs. Proccedings of the ACM Symposium on Principles of Database Systems, pages 1--15, Cambridge, Massachusetts, 1986.
From Datalog Rules to Optimal Algorithms with Time and Space.. - Liu, Stoller (2003) (Correct)
....and the data structures. Optimization methods for Datalog include smart evaluation methods and rewriting methods [10] The former includes bottom up evaluation [10, 25] semi naive evaluation [10] and topdown evaluation with tabling [35, 11] The latter includes magic sets transformation [6], among others [10] Our method is not an evaluation method because it transforms the rules rather than evaluating them; our method is not a rewriting method in that it does not transform within the frameworks of rules or some algebras. Instead, it compiles the rules directly into an ....
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1-16. ACM, New York, 1986.
Program Optimization Using Indexed and Recursive Data Structures - Liu, Stoller (2002) (Correct)
....algorithms by transforming recursive functions or set based languages appears in the introduction. There has also been work on deriving recursive equations from input and output relations, e.g. 35] Techniques such as magic set and tabled Prolog, for bottom up evaluation of logic programs [3, 15, 25, 26, 36], are also closely related. Our method based on incrementalization essentially achieves bottom up evaluation by static transformation of the original program. It improves running time and at the same time minimizes space consumption. For example, for the simple Fibonacci function, our transformed ....
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1-16. ACM, New York, 1986.
Efficient Execution of Recursive Queries Through Controlled.. - Greco, Zaniolo (Correct)
....against those of previous methods. 1 Introduction Several strategies has been proposed for the optimization of bound Datalog queries. Most of these strategies rewrite the original program into a queryequivalent new program which can be evaluated more e#ciently by the seminaive algorithm [2, 14, 4, 3, 9, 10, 12]. The improved e#ciency of the rewritten program is due to the fact that it restricts the search to the portion of the underlying database that is relevant to the query. Other techniques present special algorithms that compute directly the original program [7, 17, 1, 6, 18] Rewriting based ....
....Other techniques present special algorithms that compute directly the original program [7, 17, 1, 6, 18] Rewriting based techniques can be classified according to their generality. Techniques that can be applied to all programs include the magic set method and the supplementary magic set method [2, 4]. Specialized techniques include the factorization and reduction of programs [9] the combination of the propagation of bindings with a successive reduction [10] and the counting method [2, 13, 1, 6] These specialized techniques are important, since many programs of practical interest contain ....
[Article contains additional citation context not shown here]
F. Bancilhon, D. Mayer, Y. Sagiv, J.F. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. Fifth ACM PODS, pp 1-15, 1986.
Grammars And Automata To Optimize Chain Logic Queries - Greco, Sacca (1999) (2 citations) (Correct)
.... database applications over the traditional top down approaches [31] The e#ectiveness of the bottom up execution for bound queries is based on optimizations techniques that transform the original program into an equivalent one that e#ciently exploits bindings during fixpoint based computation [5, 6, 8, 14, 22, 23, 26, 31]. These rewriting techniques give the bottom up computation a wider applicability range than the top down computation typical of Prolog, and have been used successfully in several deductive database prototypes. As discussed next, however, there still remains room for major extensions and ....
....not fully exploit the query bindings. On the other hand, the counting method is very e#ective for chain queries with bindings, for many chain queries whose recursive rules are linear; however, this method, although proposed in the context of general queries [29] looses its simplicity and e#ciency [5, 31] for nonlinear queries, and even for some linear ones. In this paper we propose a general method that exploits the relationships between chain queries and context free languages. We shall show that classical grammar transformations can be applied to optimize our queries. Moreover, the wellknown ....
F. Bancilhon, D. Mayer, Y. Sagiv, and J.F. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. of the Fifth ACM PODS, 1986, pages 1--15.
The Generalized Counting Method For Recursive Logic Queries - Sacca, Zaniolo (1988) (15 citations) (Correct)
....and efficiently recursire Horn clauses in the presence of query constants. For this purpose, it introduces a powerful technique, called the Generalized Counting Method, which, in many cases, is more effective in dealing with recursire predicates with function symbols than those previously known [5, 6, 11, 17, 22]. SG(x, y) P(x, x) SG(x, y) P(y, SG(x, x) H(x) Fig. 1. The same generation example. 2. Fixpoint evaluation of recurslye queries Take the recurslye rule of Fig. 1, where P(x, x) is a database predicate describing that x is the parent of x, and H(x) is a database predicate describing ....
....section. This method, called the Generalized Counting Method, is an extension of the counting method described in [17] for solving a particular class of logic queries without function symbols and without comparison predicates. An informal description of the counting method was first given in [5]. The generalized counting method recasts a query into a pair of fixpoint computations that are, in general, more efficient than computing the query via a single fixpoint computation or using other techniques for its resolution (see [7, 13] for a description of the efficient behavior of the ....
[Article contains additional citation context not shown here]
F. Bancilhon, D. Maier, Y. Sagiv and J. Ullman, Magic sets and other strange ways to implement logic programs, in: Proc 5th ACM SIGMOD SIGACT vmp. on Principles of Database Systems (1986) 1-15.
Precise Interprocedural Dataflow Analysis - With Applications To Self-citation (Sagiv) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM Symposium on Principles of Database Systems, 1986.
Demand Interprocedural Dataflow Analysis - Susan Horwitz Thomas Self-citation (Sagiv) (Correct)
No context found.
Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J., "Magic sets and other strange ways to implement logic programs, " in Proceedings of the Fifth ACM Symposium on Principles of Database Systems, (Cambridge, MA), (March 1986).
Speeding Up Inferences Using Relevance - Reasoning Formalism And Self-citation (Sagiv) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM Symposium on Principles of Database Systems, pages 1--15, 1986.
Weighted Pushdown Systems - And Their Application (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM Symposium on Principles of Database Systems, New York, NY, 1986. ACM Press.
Weighted Pushdown Systems and their - Application To Interprocedural (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, J. Ullman, Magic sets and other strange ways to implement logic programs, in: Proceedings of the Fifth ACM Symposium on Principles of Database Systems, ACM Press, New York, NY, 1986.
Program Analysis via Graph Reachability - Thomas Reps Computer (Correct)
No context found.
Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J., "Magic sets and other strange ways to implement logic programs," pp. 1-15 in Proc. of the Fifth ACM Symp. on Princ. of Database Syst., (Cambridge, MA, Mar. 1986), (1986).
Context-Sensitive Program Analysis as Database Queries - Monica Lam John (2005) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs (extended abstract). In PODS '86: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1--15, 1986.
Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995) (19 citations) (Correct)
No context found.
Bancilhon, F., Maier, D., Sagiv, Y. and Ullman, J. Magic sets and other strange ways to implement logic programs. In Proceedings of the 5th ACM Symposium on Principles of Database Systems, (1986) 1--15.
Using Datalog with Binary Decision Diagrams for Program.. - Whaley, Avots, Carbin, Lam (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs (extended abstract). In PODS '86: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1--15. ACM Press, 1986.
Context-Sensitive Program Analysis as Database Queries - Monica Lam John (2005) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs (extended abstract). In PODS '86: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1--15, 1986.
Implementation of an Executable Graphical Representation of GAPs .. - Jekutsch (Correct)
No context found.
Bancilhon, F., Maier, D., Sagiv, Y., Ullman, D.D. Magic Sets and other strange ways to implement logic programs Proceedings of ACM Symposium on Principles of Database Systems, 19 pp. 1-15
Declarative Networking: Language, Execution and.. - Loo, Condie.. (2006) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic Sets and Other Strange Ways to Implement Logic Programs. In SIGMOD, 1986.
Query Translation from XPath to SQL in the Presence of.. - Fan, Yu, Lu, Lu, Rastogi (2005) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In PODS, 1986.
Context-Sensitive Program Analysis as Database Queries - Monica Lam John (2005) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs (extended abstract). In PODS '86: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1--15, 1986.
Computational Models for Information Reuse - Fontana, Formato, Pareschi (1999) (Correct)
No context found.
Bancilhon, F., Maier, D., Sagiv Y. and Ullman, J. (1986) Magic sets and other strange ways to implement logic programs. In Proc. 5th ACM SIGACT/SIGMOD Symp. on Principles of Database Systems, Cambridge, pp. 1--15. ACM Press, New York.
Ontology-based Infrastructure for Intelligent Applications - Eberhart (2004) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs (extended abstract). In Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, pages 1--15, Cambridge, MA, USA, 1986. ACM Press. 181
From Datalog Rules to Efficient Programs with Time and Space.. - Liu, Stoller (2003) (2 citations) (Correct)
No context found.
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 1--16. ACM, New York, 1986.
On the Implementation of a Simple Class of Logic Queries for.. - Saccà, Zaniolo (Correct)
No context found.
Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D, "Magic sets and other strange ways to implement logic programs", Proc. 5th ACM SIGMODSIGACT Syrup. on Principles of Database Sys- tems, 198.
First 50 documents Next 50
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