Query optimization for parallel execution
Sumit Ganguly, Waqar Hasan, Ravi Krishnamurthy · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1992
The decreasing cost of computing makes it economically viable to reduce the response time of decision support queries by using parallel execution to exploit inexpen-sive resources. This goal poses the following query op-timization problem: Mzntmzze response ttme subject to constraints on throughput, which we motivate as the dual of the traditional DBMS problem, We address this novel problem in the context of Select-Project-Join queries by extending the execution space, cost model and search al-gorithm that are widely used in commercial DBItlSs. We incorporate the sources and deterrents of parallelism in the traditional execution space. We show that a cost model can predict response time while accounting for the new aspects due to parallelism, We observe that the response time optimization metric violates a fundamen-tal assumption in the dynamic programming algorithm that is the linchpin in the optimizers of most commer-cial DBMSS. We extend dynamic programming and show how optimization metrics which correctly predict response time may be designed. 1
Cited by 207 works. doi:10.1145/130283.130291
Authors
References
- Access path selection in a relational database management system
- Benchmark Handbook: For Database and Transaction Processing Systems
- Princeton University Press
- The Gamma database machine project
- A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
- A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
- Optimization of parallel query execution plans in XPRS
- Optimization Algorithms for Distributed Queries
- Parallel database systems
- Parallelism in relational data base systems