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.Information Systems Working Papers Serie
Traditional query optimization concentrates on the optimization of the execution of each individual ...
In the current work, we derive a complete approach to optimization and automatic parallelization of ...
Query processing in databases can be divided into two steps: selecting an 'optimal' evaluation strat...
The simultaneous optimization of multiple queries submitted to a database system may lead to substan...
Complex queries often contain common or similar subexpressions, either within a single query or amon...
Complex queries often contain common or similar subexpressions, either within a single query or amon...
Some recently proposed extensions to relational database systems as well as deductive database syste...
With the increase in mediated applications, there are now mediated application servers that support ...
Most queries in a collection of queries, also called a query workload, to some degree have parts of ...
In query optimization, a query can be executed with different strategies, known as execution plan. T...
In query optimization, a query can be executed with different strategies, known as execution plan. T...
Database systems frequently have to execute a set of related queries, which share several common sub...
Current database systems typically process queries in a query-at-a-time fashion without considering ...
textabstractIn some key database applications, such as data mining, a sequence of interdependent qu...
Using common subexpressions to speed up a set of queries is a well known and long studied problem. H...
Traditional query optimization concentrates on the optimization of the execution of each individual ...
In the current work, we derive a complete approach to optimization and automatic parallelization of ...
Query processing in databases can be divided into two steps: selecting an 'optimal' evaluation strat...
The simultaneous optimization of multiple queries submitted to a database system may lead to substan...
Complex queries often contain common or similar subexpressions, either within a single query or amon...
Complex queries often contain common or similar subexpressions, either within a single query or amon...
Some recently proposed extensions to relational database systems as well as deductive database syste...
With the increase in mediated applications, there are now mediated application servers that support ...
Most queries in a collection of queries, also called a query workload, to some degree have parts of ...
In query optimization, a query can be executed with different strategies, known as execution plan. T...
In query optimization, a query can be executed with different strategies, known as execution plan. T...
Database systems frequently have to execute a set of related queries, which share several common sub...
Current database systems typically process queries in a query-at-a-time fashion without considering ...
textabstractIn some key database applications, such as data mining, a sequence of interdependent qu...
Using common subexpressions to speed up a set of queries is a well known and long studied problem. H...
Traditional query optimization concentrates on the optimization of the execution of each individual ...
In the current work, we derive a complete approach to optimization and automatic parallelization of ...
Query processing in databases can be divided into two steps: selecting an 'optimal' evaluation strat...