Query optimization for parallel execution
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Exploiting inter-operation parallelism in XPRS
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
On parallel execution of multiple pipelined hash joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
IBM Systems Journal
Scheduling problems in parallel query optimization
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallelism and its price: a case study of nonstop SQL/MP
ACM SIGMOD Record
Parallel evaluation of multi-join queries
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Open issues in parallel query optimization
ACM SIGMOD Record
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
Parallel Execution of Hash Joins in Parallel Databases
IEEE Transactions on Parallel and Distributed Systems
An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
Benchmarking the DBS3 Parallel Query Optimizer
IEEE Parallel & Distributed Technology: Systems & Technology
Parallel query processing with zigzag trees
The VLDB Journal — The International Journal on Very Large Data Bases - Parallelism in database systems
Considering data skew factor in multi-way join query optimization for parallel execution
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
Encapsulation of Parallelism and Architecture-Independence in Extensible Database Query Execution
IEEE Transactions on Software Engineering
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
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
Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Applying Hash Filters to Improving the Execution of Bushy Trees
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Managing Memory to Meet Multiclass Workload Response Time Goals
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On applying hash filters to improving the execution of multi-join queries
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
The Design, Implementation and Evaluation of an ODMG Compliant, Parallel Object Database Server
Distributed and Parallel Databases
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Parallel querying with non-dedicated computers
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Revisiting pipelined parallelism in multi-join query processing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Execution Optimization for Composite Services Through Multiple Engines
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Parallel Query Processing in Databases on Multicore Architectures
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
H-store: a high-performance, distributed main memory transaction processing system
Proceedings of the VLDB Endowment
Architecture of a Database System
Foundations and Trends in Databases
Relational query coprocessing on graphics processors
ACM Transactions on Database Systems (TODS)
A new look at generating multi-join continuous query plans: A qualified plan generation problem
Data & Knowledge Engineering
Quality contracts for real-time enterprises
BIRTE'06 Proceedings of the 1st international conference on Business intelligence for the real-time enterprises
Cluster-and-conquer: hierarchical multi-metric query processing in large-scale database federations
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
ASTERIX: towards a scalable, semistructured data platform for evolving-world models
Distributed and Parallel Databases
Optimised X-HYBRIDJOIN for near-real-time data warehousing
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Supporting distributed feed-following apps over edge devices
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In this paper, we describe our approach to the optimization of query execution plans in XPRS1, a multi-user parallel dtabase machine based on a shared-memory multiprocessor and a disk array. The main difficulties in this optimization problem are the compile-time unknown parameters such as available buffer size and number of free processors, and the enormous search space of possible parallel plans. We deal with these problems with a novel two phase optimization strategy which dramatically reduces the search space and allows run time parameters without significantly compromising plan optimality. In this paper we present our two phase strategy and give experimental evidence from XPRS bencmarks that indicate that it almost always produces optimal plans.