Technical Perspective: Revisiting Runtime Dynamic Optimization for Join Queries in Big Data Management Systems

被引:0
|
作者
Kipf, Andreas [1 ]
机构
[1] Amazon Web Serv, Seattle, WA 98109 USA
关键词
Compendex;
D O I
10.1145/3604437.3604459
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Query optimization is the process of finding an efficient query execution plan for a given SQL query. The runtime difference between a good and a bad plan can be tremendous. For example, in the case of TPC-H query 5, a query with 5 joins, the difference between the best and the worst plan is more than 10,000×. Therefore, it is vital to avoid bad plans. The dominating factor which differentiates a good from a bad plan is their join order and whether this join order avoids large intermediate results. © 2023 Association for Computing Machinery. All rights reserved.
引用
收藏
页码:103 / 103
页数:1
相关论文
共 3 条