ACM Home Page
Please provide us with feedback. Feedback
Rule-based transformation of relational queries into iterative programs
Full text PdfPdf (876 KB)
Source International Conference on Management of Data archive
Proceedings of the 1986 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 206 - 214  
Year of Publication: 1986
ISBN:0-89791-191-1
Also published in ...
Authors
Johann Christoph Freytag  IBM Almaden Research Center, San Jose, CA
Nathan Goodman  Kendall Square Research Corp., Cambridge, MA
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/16894.16875
What is a DOI?

ABSTRACT

Over the last decade many techniques for optimizing relational queries have been developed. However, the problem of translating these set-oriented query specifications into other forms for efficient execution has received little attention. This paper presents an algorithm that translates algebra-based query specifications into iterative programs for an efficient execution. While the source level operates on sets of tuples, the generated programs manipulate tuples as their basic objects. The algorithm incorporates techniques which have been developed in the areas of functional programming and program transformation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

ASTR76
BELL84
BIRD84
BUNE82
BURS77
 
COHE80
Cohen, N H, Source-to-Source improvement of Recurstve Programs, PhD Thesis, Harvard UmversRy (May 1980)
 
DANI82
Dames, D, Query Compdatwn tn a Dtstrtbuted Database System, Techmcal Report RJ #3432, IBM Research Laboratoy, San Jose, CA 95193 (March 1982)
 
DARL76
Darlmgton, J and Burstall, R M, A System whwh Automattcally Improves Programs, Acta Informatlca 6,1 (January 1976) pp 41-60
 
FREY85
Freytag, J C, Translaung Relatwnal Querws into Iteratlve Programs, PhD Thesis, Harvard Umversaty, also Techmcal Report TR-14-85 (September 1985)
 
FRIE76
Friedman, D P and Wlese, D S, CONS should not Evaluate tts Arguments, in S Mlchaelson and r Mflner, Automata, Languages, and Programming, Edinburgh Umversaty Press (Edinburgh, 1976) pp 257-284
GIVL84
GOLD84
HUET80
JARK84
 
LORI79
Lone, R A and Wade, B W, The Compdatton of a High Level Data Language, Techmcal Report RJ #2598, IBM Research Laboratory, San Jose, CA 95193 (1979)
REES82
STON76

CITED BY  11

Collaborative Colleagues:
Johann Christoph Freytag: colleagues
Nathan Goodman: colleagues