Global query optimization
Timos Sellis · ACM SIGMOD Record · 1986
In some recently proposed extensions to relational database systems as well as in deductive databases, a database system is presented with a collection of queries to process instead of just one. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time. We examine the problem of multiple (global) query optimization in this paper. A hierarchy of algorithms that can be used for global query optimization is exhibited and analyzed. These algorithms range from an arbitrary serial execution without any sharing of common results among the queries to an exhaustive search of all possible ways to process all queries.
Cited by 70 works. doi:10.1145/16856.16874 Open-access PDF
Authors
References
- System R
- Access path selection in a relational database management system
- The design and implementation of INGRES
- Decomposition—a strategy for query processing
- Logic and Data Bases
- UNIVERSITY OF CALIFORNIA
- The database language GEM
- Common expression analysis in database applications
- View indexing in relational databases
- An optimizing prolog front-end to a relational query system