TY - JOUR
T1 - Argument reduction by factoring
AU - Naughton, J. F.
AU - Ramakrishnana, R.
AU - Sagiv, Y.
AU - Ullman, J. D.
PY - 1995/7/24
Y1 - 1995/7/24
N2 - We identify a useful property of a program with respect to a predicate, calledfactoring. While we prove that detecting factorability is undecidable in general, we show that for a large class of programs, the program obtained by applying the Magic Sets transformation is factorable with respect to the recursive predicate. When the factoring property holds, a simple optimization of the program generated by the Magic Sets transformation results in a new program that is never less efficient than the Magic Sets program and is often dramatically more efficient, due to the reduction of the arity of the recursive predicate. We show that the concept of factoring generalizes some previously identified special cases of recursions, including separable recursions and right- and left-linear recursions.
AB - We identify a useful property of a program with respect to a predicate, calledfactoring. While we prove that detecting factorability is undecidable in general, we show that for a large class of programs, the program obtained by applying the Magic Sets transformation is factorable with respect to the recursive predicate. When the factoring property holds, a simple optimization of the program generated by the Magic Sets transformation results in a new program that is never less efficient than the Magic Sets program and is often dramatically more efficient, due to the reduction of the arity of the recursive predicate. We show that the concept of factoring generalizes some previously identified special cases of recursions, including separable recursions and right- and left-linear recursions.
UR - http://www.scopus.com/inward/record.url?scp=0348245619&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(94)00186-M
DO - 10.1016/0304-3975(94)00186-M
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0348245619
SN - 0304-3975
VL - 146
SP - 269
EP - 310
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-2
ER -