Common expression analysis in database applications
Sheldon J. Finkelstein · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1982
Independent optimization of database requests overlooks potential savings which can be achieved when they are optimized collectively. An intuitive model for queries called the query graph supports common expression detection for optimization of a stream of requests. We describe how ad hoc query processing can be improved using intermediate results and answers produced from earlier queries, without significantly impacting processing costs when no common expressions are found. We have written a Pascal program, COMMON, which implements a variation of the algorithm which we describe.
Cited by 218 works. doi:10.1145/582353.582400
Authors
References
- Access path selection in a relational database management system
- The design and implementation of INGRES
- Decomposition—a strategy for query processing
- Query-by-Example: A data base language
- Implementation of a structured English query language
- Database design
- Developing a natural language interface to complex data
- Database Snapshots
- The Peterlee Relational Test Vehicle—a system overview
- Efficient optimization of a class of relational expressions