AbstractWe study the application of the magic-sets transformation technique to Datalog⌝(function-free programs with negation) that may not have two-valued well-founded models. In this general setting, the well-founded model of the original program does not always agree with the well-founded model of the magic program derived by commonly used left-to-right sideways information-passing strategies on the query. In order to correct this disagreement we present a novel method that is obtained by slightly and naturally tailoring Van Gelder's alternating fixpoint technique to any magic program
With the magic sets techniques having been proposed to improve the efficiency of bottom-up evaluatio...
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Da...
this paper we describe the application of program transformation techniques, based on sideways infor...
AbstractWe study the application of the magic-sets transformation technique to Datalog⌝(function-fre...
Abstract. We propose a generalization of the well-known Magic Sets technique to Datalog ¬ programs w...
AbstractRecently, effective methods model query-answering in data integration systems and inconsiste...
Abstract. We present a new technique for the optimization of (partially) bound queries over disjunct...
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive lo...
AbstractIn this paper, a new technique for the optimization of (partially) bound queries over disjun...
this paper we will write database queries in datalog [Ull89]. Datalog is the language of horn clause...
The magic-sets transformation is a useful technique for dramatically improving the performance of co...
Dottorato di Ricerca in Matematica ed Informatica, XXIII Ciclo,a.a.2009-2010Disjunctive Datalog with...
AbstractIn dataflow analysis of logic programs, information must be propagated according to the cont...
In data ow analysis of logic programs, information must be propagated according to the control strat...
AbstractWe present a bottom-up operational procedure for computing well-founded models of allowed pr...
With the magic sets techniques having been proposed to improve the efficiency of bottom-up evaluatio...
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Da...
this paper we describe the application of program transformation techniques, based on sideways infor...
AbstractWe study the application of the magic-sets transformation technique to Datalog⌝(function-fre...
Abstract. We propose a generalization of the well-known Magic Sets technique to Datalog ¬ programs w...
AbstractRecently, effective methods model query-answering in data integration systems and inconsiste...
Abstract. We present a new technique for the optimization of (partially) bound queries over disjunct...
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive lo...
AbstractIn this paper, a new technique for the optimization of (partially) bound queries over disjun...
this paper we will write database queries in datalog [Ull89]. Datalog is the language of horn clause...
The magic-sets transformation is a useful technique for dramatically improving the performance of co...
Dottorato di Ricerca in Matematica ed Informatica, XXIII Ciclo,a.a.2009-2010Disjunctive Datalog with...
AbstractIn dataflow analysis of logic programs, information must be propagated according to the cont...
In data ow analysis of logic programs, information must be propagated according to the control strat...
AbstractWe present a bottom-up operational procedure for computing well-founded models of allowed pr...
With the magic sets techniques having been proposed to improve the efficiency of bottom-up evaluatio...
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Da...
this paper we describe the application of program transformation techniques, based on sideways infor...