Combining worst-case optimal and traditional binary join processing
Worst-case optimal join algorithms are attractive from a theoretical point of view, as they offer
asymptotically better runtime than binary joins on certain types of queries. In particular, they
avoid enumerating large intermediate results by processing multiple input relations in a
single multi-way join. However, existing implementations incur a sizable overhead in
practice, primarily since they rely on suitable ordered index structures on their input.
Systems that support worst-case...»
asymptotically better runtime than binary joins on certain types of queries. In particular, they
avoid enumerating large intermediate results by processing multiple input relations in a
single multi-way join. However, existing implementations incur a sizable overhead in
practice, primarily since they rely on suitable ordered index structures on their input.
Systems that support worst-case...»
Abstract
Worst-case optimal join algorithms are attractive from a theoretical point of view, as they offer asymptotically better runtime than binary joins on certain types of queries. In particular, they avoid enumerating large intermediate results by processing multiple input relations in a single multi-way join. However, existing implementations incur a sizable overhead in practice, primarily since they rely on suitable ordered index structures on their input. Systems that support worst-case...»
mediatum.ub.tum.de
以上显示的是最相近的搜索结果。 查看全部搜索结果