On parallel execution of multiple pipelined hash joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Parallelism and its price: a case study of nonstop SQL/MP
ACM SIGMOD Record
Parallel execution of integrity constraint checks
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Scheduling and mapping for parallel execution of extended SQL queries
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Parallel evaluation of multi-join queries
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient and accurate cost models for parallel query optimization (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Computer Science and Technology
Parallel query processing with zigzag trees
The VLDB Journal — The International Journal on Very Large Data Bases - Parallelism in database systems
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
IEEE Transactions on Knowledge and Data Engineering
Optimization of Parallel Execution for Multi-Join Queries
IEEE Transactions on Knowledge and Data Engineering
Optimizing Large Join Queries Using A Graph-Based Approach
IEEE Transactions on Knowledge and Data Engineering
On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Multi-Join Optimization for Symmetric Multiprocessors
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Coloring Away Communication in Parallel Query Optimization
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A modeling tool for workload analysis and performance tuning of parallel database applications
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
| Hi-index | 0.00 |
In this paper, we describe our approach to the compile-time optimization and parallelization of queries for execution in DBS3, a shared-memory parallel database system. Our approach enables exploring a search space large enough to include zigzag trees which are intermediate between left-deep and right-deep trees. Zigzag trees are shown to provide better response time than right-deep trees in the case of limited memory. Because DBS3 implements a parallel dataflow execution model, this approach applies to both shared-memory and distributed-memory architectures. Performance measurements run using the DBS3 prototype show the advantages of zigzag trees under various conditions.