快速分布式复杂连接处理
Fast Distributed Complex Join Processing
摘要：
在这项工作中，我们研究了问题的协同优化通信，预计算，计算成本在一轮多路连接评估。本文提出了一种多路连接的复杂连接方法ADJ（Adaptive Distributed Join），它通过在预计算、通信和计算之间进行权衡来寻找一个最优的查询计划，并分析了一个给定连接查询的输入关系，在一组特定形式的查询计划中找到一个最优的查询计划，同时通过抽样进行高质量的成本估计。我们广泛的实验证实，ADJ优于现有的多路连接方法的数量级。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
