A query engine that supports both hash-based and sort-based worst-case optimal joins reports average speedups of 1.4x to 1.5x and a maximum of 4.8x over the Free Join framework.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing
A query engine that supports both hash-based and sort-based worst-case optimal joins reports average speedups of 1.4x to 1.5x and a maximum of 4.8x over the Free Join framework.