In this work, we study the problem of co-optimize communication, pre-computing, and computation cost in one-round multi-way join evaluation. We propose a multi-way join approach ADJ (Adaptive Distributed Join) for complex join which finds one optimal query plan to process by exploring cost-effective partial results in terms of the trade-off between pre-computing, communication, and computation.We analyze the input relations for a given join query and find one optimal over a set of query plans in some specific form, with high-quality cost estimation by sampling. Our extensive experiments confirm that ADJ outperforms the existing multi-way join methods by up to orders of magnitude.
翻译:在这项工作中,我们研究了在单轮多路连接评价中优化通信、预先计算和计算成本的问题。我们建议对复杂的连接采用多路连接方法ADJ(Adapivedition Join),通过探索计算前、通信和计算之间的平衡方面具有成本效益的局部结果,找到一个最佳查询计划。我们分析了特定连接查询的输入关系,找到一种比一套特定查询计划最理想的方式,通过抽样进行高质量的成本估计。我们的广泛实验证实,ADJ在数量上优于现有的多条连接方法。