Optimization of parallel query execution plans in XPRS
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 218-225
- https://doi.org/10.1109/pdis.1991.183106
Abstract
The authors describe their approach to the optimization of query execution plans in XPRS, a multi-user parallel database machine based on a shared-memory multi-processor 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. The authors 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. They present their two phase strategy and give experimental evidence from XPRS benchmarks that indicate that it almost always produces optimal plans.<>Keywords
This publication has 7 references indexed in Scilit:
- Processor scheduling for multiprocessor joinsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A performance comparison of two architectures for fast transaction processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Execution plan balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Index scans using a finite LRU buffer: a validated I/O modelACM Transactions on Database Systems, 1989
- Dynamic query evaluation plansPublished by Association for Computing Machinery (ACM) ,1989
- Join processing in database systems with large main memoriesACM Transactions on Database Systems, 1986
- Access path selection in a relational database management systemPublished by Association for Computing Machinery (ACM) ,1979