ACM Transactions on Database Systems (TODS)
Multiple query optimization with Depth-First Branch-and-Bound and dynamic query ordering
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Workload scheduling for multiple query processing
Information Processing Letters
Scheduling multiple queries in symmetric multiprocessors
Information Sciences: an International Journal
Simultaneous optimization and evaluation of multiple dimensional queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Exploring Expect
Common Subexpression Processing in Multiple-Query Processing
IEEE Transactions on Knowledge and Data Engineering
Using Common Subexpressions to Optimize Multiple Queries
Proceedings of the Fourth International Conference on Data Engineering
The Value of Merge-Join and Hash-Join in SQL Server
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Pipelining in multi-query optimization
Journal of Computer and System Sciences - Special issu on PODS 2001
Modeling and exploiting query interactions in database systems
Proceedings of the 17th ACM conference on Information and knowledge management
Query interactions in database workloads
Proceedings of the Second International Workshop on Testing Database Systems
Predicting completion times of batch query workloads using interaction-aware models and simulation
Proceedings of the 14th International Conference on Extending Database Technology
Interaction-aware scheduling of report-generation workloads
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Multiple concurrent queries occur in many database settings. This paper describes the use of middleware as an optimization tool for such queries. Since common subexpressions derive from common data and the data is usually greatest at the source, the middleware exploits the presence of sharable access patterns to underlying data, especially scans of large portions of tables or indexes, in environments where query queuing or batching is an acceptable approach. The results show that simultaneous queries with such sharable accesses have a tendency to form synchronous groups (teams) which benefit each other through the operation of the disk cache, in effect using it as an implicit pipeline. the middleware exploits this tendency by queuing and scheduling the queries to promote this interaction, using an algorithm designed to promote such teamwork. This is implemented as middleware for use with a commercial database engine. The results include tests using the query mix from the TPC BenchmarkTMR, achieving a speed-up of 2.34 over the default scheduling provided by one database. Other results show that the success depends on the details of the computing environment.