On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Improvements on a heuristic algorithm for multiple-query optimization
Data & Knowledge Engineering
Multiple-query optimization at algorithm-level
Data & Knowledge Engineering
Rapid bushy join-order optimization with Cartesian products
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the complexity of generating optimal plans with cross products (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Common expression analysis in database applications
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
On the Multiple-Query Optimization Problem
IEEE Transactions on Knowledge and Data Engineering
Common Subexpression Processing in Multiple-Query Processing
IEEE Transactions on Knowledge and Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Multiple Query Processing in Deductive Databases using Query Graphs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Anatomy of a Mudular Multiple Query Optimizer
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Fast, Randomized Join-Order Selection - Why Use Transformations?
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
MIL primitives for querying a fragmented world
The VLDB Journal — The International Journal on Very Large Data Bases
Multi Query Optimization Using Query Pack Trees
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Macro- and Micro-parallelism in a DBMS
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.00 |
Database systems allow for concurrent use of several applications (and query interfaces). Each application generates an "optimal" plan--a sequence of low-level database operators--for accessing the database. The queries posed by users through the same application can be optimized together using traditional multi-query optimization techniques. However, the commonalities among queries of different applications are not exploited. In this paper we present an efficient inter-application multi-query optimizer that re-uses previously computed (intermediate) results and eliminates redundant work. Experimental results on a single CPU system and a parallel system show that the inter-application multi-query optimizer improves the query evaluation performance significantly.