Argument reduction by factoring

J. F. Naughton*, R. Ramakrishnan, Y. Sagiv, J. D. Ullman

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

24 Scopus citations

Abstract

We identify a useful property of a program with respect to a predicate, called factoring. 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, and that the specialized evaluation algorithms and rewriting strategies developed for those classes can be derived automatically by applying the Magic Sets transformation and then factoring the result.

Original languageEnglish
Pages173-182
Number of pages10
StatePublished - Aug 1989
EventProceedings of the Fifteenth International Conference on Very Large Data Bases - Amsterdam, Neth
Duration: 22 Aug 198925 Aug 1989

Conference

ConferenceProceedings of the Fifteenth International Conference on Very Large Data Bases
CityAmsterdam, Neth
Period22/08/8925/08/89

Fingerprint

Dive into the research topics of 'Argument reduction by factoring'. Together they form a unique fingerprint.

Cite this