A transformation-based approach to optimizing loops in database programming languages
Authors:
Open Access
- 1 June 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 21 (2) , 91-100
Abstract
Database programming languages like O 2 , E , and O ++ include the ability to iterate through a set. Nested iterators can be used to express joins. This paper describes compile-time optimizations similar to relational transformations like join reordering for such programming constructs. This paper also shows how to use a standard transformation-based optimizer to optimize these joins. An optimizer built using the EXODUS Optimizer Generator [GRAE87] was added to the Bell Labs O ++ [AGRA89] compiler. We used the resulting optimizing compiler to experimentally validate the ideas in this paper. The experiments show that this technique can significantly improve the performance of database programming languages.Keywords
This publication has 12 references indexed in Scilit:
- A performance evaluation of pointer-based joins1990
- Multiple-query optimizationACM Transactions on Database Systems, 1988
- Grammar-like functional rules for representing query optimization alternatives1988
- Optimization of nested SQL queries revisited1987
- Advanced compiler optimizations for supercomputersCommunications of the ACM, 1986
- Analysis of the context dependency of CODASYL find-statements with application to a database program conversion1985
- Implementation techniques for main memory database systems1984
- On optimizing an SQL-like nested queryACM Transactions on Database Systems, 1982
- Decompiling CODASYL DML into retional queriesACM Transactions on Database Systems, 1982
- Some high level language constructs for data of type relationACM Transactions on Database Systems, 1977