Results 1  10
of
3,073
OnePhase Magicsets Transformation (Extended Abstract)
, 1994
"... ) Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Abstract Magicsets transformation is typically applied to a program in two phases  an adornment phase, and a magicsets phase. A major drawback of the twophase transformation is that join ordering, needed to do the ador ..."
Abstract
 Add to MetaCart
) Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Abstract Magicsets transformation is typically applied to a program in two phases  an adornment phase, and a magicsets phase. A major drawback of the twophase transformation is that join ordering, needed to do
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 649 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
Magicsets Transformation in Nonrecursive Systems
 In Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS
, 1992
"... this paper we will write database queries in datalog [Ull89]. Datalog is the language of horn clause logic rules, written as "ifthen" rules. A datalog rule is required to be rangerestricted: it must define a finite relation for the predicate in the head of the rule. In this paper we will ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
this paper we will write database queries in datalog [Ull89]. Datalog is the language of horn clause logic rules, written as "ifthen" rules. A datalog rule is required to be rangerestricted: it must define a finite relation for the predicate in the head of the rule. In this paper we will concentrate on nonrecursive queries. Mumick [Mum91] shows that nonrecursive datalog programs can be expressed in SQL using views, and that SQL queries can be expressed in datalog extended with duplicates and grouping with aggregation. Thus, the algorithms developed in this paper can be mapped to relational database systems having SQL as their query language. We will use dependency graphs to represent the dependence between predicates in a datalog program.
Enhancing the MagicSet Method for Disjunctive Datalog Programs
 In Proc. 20th International Conference on Logic Programming (ICLP 04), Springer LNCS 3132
, 2004
"... Abstract. We present a new technique for the optimization of (partially) bound queries over disjunctive datalog programs. The technique exploits the propagation of query bindings, and extends the MagicSet optimization technique (originally defined for nondisjunctive programs) to the disjunctive ca ..."
Abstract

Cited by 33 (10 self)
 Add to MetaCart
case, substantially improving on previously defined approaches. MagicSettransformed disjunctive programs frequently contain redundant rules. We tackle this problem and propose a method for preventing the generation of such superfluous rules during the MagicSet transformation. In addition, we provide
MagicSets Transformation for the Analysis of Java Bytecode
 In SAS
, 2007
"... Abstract. Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the functional i.e., input/output behaviour of a program P, not enough if one needs P ’s internal behaviours i.e., ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
.e., from the input to some internal program points. We overcome this limitation with a technique used up to now for logic programs only. It adds new magic blocks of code to P, whose functional behaviours are the internal behaviours of P. We prove this transformation correct with an operational semantics
Implementation of Magicsets in a Relational Database System
 In Proc. of ACM SIGMOD
, 1994
"... We describe the implementation of the magicsets transformation in the Starburst extensible relational database system. To our knowledge this is the first implementation of the magicsets transformation in a relational database system. The Starburst implementation has many novel features that make o ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We describe the implementation of the magicsets transformation in the Starburst extensible relational database system. To our knowledge this is the first implementation of the magicsets transformation in a relational database system. The Starburst implementation has many novel features that make
A Magicset Approach to Computing Stable Models on MGTP
"... The stable model semantics is now one of the standard semantics for general logic programs. A simple procedure for computing stable models has been proposed by Inoue et al. [IKH92]. In this paper, we present efficient techniques to compute the stable models of a general logic program. We propose a p ..."
Abstract
 Add to MetaCart
program transformation based on the magicsets, which generates models and analyzes negationasfailure atoms dynamically. We also show experimental results which show remarkable speedup compared with the original procedure. 1 Introduction The stable model semantics [GL88] is now one of the standard
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
, 2006
"... Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NPhard in general. We show here that for systems with ‘typical’/‘random ’ Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our pr ..."
Abstract

Cited by 274 (22 self)
 Add to MetaCart
proposal, Stagewise Orthogonal Matching Pursuit (StOMP), successively transforms the signal into a negligible residual. Starting with initial residual r0 = y, at the sth stage it forms the ‘matched filter ’ Φ T rs−1, identifies all coordinates with amplitudes exceeding a speciallychosen threshold, solves
DOI 10.1007/s1099001090637 Magicsets for localised analysis of Java bytecode
"... Abstract Static analyses based on denotational semantics can naturally model functional behaviours of the code in a compositional and completely context and flow sensitive way. But they only model the functional i.e., input/output behaviour of a program P, not enough if one needs P ’s internal behav ..."
Abstract
 Add to MetaCart
transformation that adds new magic blocks of code to the program P, whose functional behaviours are the internal behaviours of P. We prove the transformation correct w.r.t. an operational semantics and define an equivalent denotational semantics, devised for abstract interpretation, whose denotations
Exponential numerical methods for onedimensional onephase Stefan problems
"... Summary Three exponential iterative methods for onedimensional onephase Stefan problems based on the transformation of the moving boundary problem into a fixed one, the discretization of the time variable, and the piecewise linearization of the resulting twopoint boundaryvalue problem at each t ..."
Abstract
 Add to MetaCart
Summary Three exponential iterative methods for onedimensional onephase Stefan problems based on the transformation of the moving boundary problem into a fixed one, the discretization of the time variable, and the piecewise linearization of the resulting twopoint boundaryvalue problem at each
Results 1  10
of
3,073