On Producing High and Early Result Throughput in Multi-Join Query Plans
In this paper, the authors' introduced an efficient framework for producing high and early result throughput in multi-join query plans. While most previous research focuses on optimizing for cases involving a single join operator, this paper takes a radical step by addressing query plans with multiple join operators. The proposed framework consists of two main methods, a flush algorithm and operator state manager. The framework assumes a symmetric hash join, a common method for producing early results, when processing incoming data. In this way, their methods can be applied to a group of previous join operators (optimized for single-join queries) when taking part in multi-join query plans.