User: Guest  Login
Title:

Combining Worst-Case Optimal and Traditional Binary Join Processing

Author(s):
Michael Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper, Thomas Neumann
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...     »
Keywords:
Worst-Case Optimal Joins; Query Processing; Query Optimization
Year:
2020
Language:
en
 BibTeX