Abstract

Abstract: The simultaneous optimization of multiple queries submitted to a database system may lead to substantial savings over the current approach of optimizing each query separately. Isolating common subexpressions in multiple queries and treating their execution as a sharable resource are important prerequisites. This chapter presents techniques for recognizing, supporting, and exploiting common subexpressions in record-oriented, relational algebra, domain relational calculus, and tuple relational calculus query representations, It also investigates preconditions that transaction management mechanisms must satisfy to make multiple query optimization effective. The joint execution of batches of queries and update operations has been a standard technique in the conventional, record-at-a-time file systems of the sixties and early seventies. However, with the introduction of interactive database systems based on direct access to specific subsets of data, the

Citations

19	The Logical Access Path Schema of a Database - Roussopoulos - 1982
12	Effects of locking granularity in a database management system - Ries, Stonebraker - 1977
5	Solving the phantom problem by predicative optimistic concurrency control - Reimer - 1983
1	Processing multiple queries in database systemsn, IEEE Database Engineering 5, 3 - S - 1982
1	Research Stem School of Business IVorking Paper IS-84-46 Page 16 [FINK821 Finkelstein, S. "Common expression analysis in database applicationsn - Grant, Hinker - 1982
1	Transaction optimization on a distributed database system - R - 1981
1	Abstraction mechanisms for database programingn - Schmidt, Mall - 1983